Claims

../

2012_08_16_fox_loh_zhao: Theorem 1.9 of Fox, Loh and Zhao (Combinatorica 2015) gives, for every n, a K_4-free graph on n vertices with at least n squared over 8 edges and independence number o(n); accepted on the refereed publication.

---