Erdős Problem #1013 — Let h_3(k) be the minimal n such that there exists a triangle-free graph on n vertices with chromatic number k.
Statement
Let be the minimal such that there exists a triangle-free graph on vertices with chromatic number . Find an asymptotic for , and also prove
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.