Bipartite induced density in triangle-free graphs

08/07/2018

∙

by   Wouter Cames van Batenburg, et al.

∙

0

∙

share

Any triangle-free graph on n vertices with minimum degree at least d contains a bipartite induced subgraph of minimum degree at least d^2/(2n). This is sharp up to a logarithmic factor in n. We also provide a related extremal result for the fractional chromatic number.