Re: A graph problem

Proginoskes <proginoskes@xxxxxxxxxxxxx> wrote:

> Just for clarification, are you asking for the following:

> What is the largest n such that K_n can be colored in 2 colors such
> that the subgraphs induced by any set of 4 vertices are colored the
> same?

Yes. Exactly. I'm not good in talking Math-ese :-)

> What's wrong with coloring all the edges with the same color? (In this
> case, n is unbounded.)

Nothing. That's a perfect valid solution, only that it
won't solve certain other constraints of my "real" problem. :-)
(where "color" means loosely "move of a generalized chess piece")
OK, add: "Both colors have to occur."
--
Hauke Reddmann <:-EX8 fc3a501@xxxxxxxxxxxxxx
His-Ala-Sec-Lys-Glu Arg-Glu-Asp-Asp-Met-Ala-Asn-Asn

.

Relevant Pages
Quantcast