Coloring graphs with forbidden bipartite subgraphs

James Anderson, Anton Bernshteyn, Abhishek Dhawan

A conjecture of Alon, Krivelevich, and Sudakov states that, for any graph $F$, there is a constant $c_F>0$ such that if $G$ is an $F$-free graph of maximum degree $\Delta$, then $χ(G)…