Problem 579

Erdős Problem #579: declared status 'open'. Formalized: no. Let $\delta>0$. If $n$ is sufficiently large and $G$ is a graph on $n$ vertices with no $K_{2,2,2}$ and at least $\delta n^2$ edges then $G$ contains an independent set of size $\gg_\delta n$. Prize: no. Tags: graph theory, turan number.