Sparse halves in dense triangle-free graphs

Sergey Norin, Liana Yepremyan

Erdős conjectured that every triangle-free graph $G$ on $n$ vertices contains a set of $\lfloor n/2\rfloor$ vertices that spans at most $n^2/50$ edges. Krivelevich proved the con…