Erdős Problem #1029 — If R(k) is the Ramsey number for K_k, the minimal n such that every 2-colouring of the edges of K_n contains a monochromatic copy of K_k, then fracR(k)k2^k/2→ ∞.
Statement
If is the Ramsey number for , the minimal such that every -colouring of the edges of contains a monochromatic copy of , then
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.