Does there exist some constant $c>0$ such that if $G$ is a graph with $n$ vertices and $\ge (1/8-c)n^2$ edges then $G$ must contain either a $K_4$ or an independent set on at least $n/\log n$ vertices?