Erdős Problem #87 — Let ε >0. Is it true that, if k is sufficiently large, then R(G)>(1-ε)^kR(k) for every graph G with chromatic number χ(G)=k?
Statement
Let . Is it true that, if is sufficiently large, then for every graph with chromatic number ? Even stronger, is there some such that, for all large , for every graph with chromatic number ?
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.