Chromatic numbers from edge ideals: Graph classes with vanishing syzygies are polynomially $\chi$-bounded

Alexander Engström

The chromatic number $\chi$ of a graph is bounded from below by its clique number $\omega ,$ but it can be arbitrary large. Perfect graphs are defined by $\chi =\omega$ for all induced subgraphs. An…