Erdős Problem #802 — Is it true that any K_r-free graph on n vertices with average degree t contains an independent set on ≫_r log t/tn many vertices?
Statement
Is it true that any -free graph on vertices with average degree contains an independent set on many vertices?
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.