Erdős Problem #615 — A Ramsey–Turán Bound for K_4
Statement
Does there exist a real constant such that, for all sufficiently large integers , every graph on vertices with at least edges contains either a copy of or an independent set of size at least ? Equivalently, does there exist such that for all sufficiently large ?
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.