Claims

../

1997_08_01_alon_krivelevich_sudakov: Every graph with chromatic number m has a subgraph of cochromatic number at least (1/4 + o(1)) m / log_2 m, tight up to the constant; refereed in J. Graph Theory and credited by the site's curator.

---