For any $ϵ>0$ there exists $\delta =\delta (ϵ)>0$ such that if $G$ is a graph on $n$ vertices with no independent set or clique of size $\ge ϵ\log n$ then $G$ contains an induced subgraph with $m$ edges for all $m\le \delta n^2$.