Burling graphs in graphs with large chromatic number

Tara Abrishami, Marcin Briański, James Davies +4

A graph class is $\chi$-bounded if the only way to force large chromatic number in graphs from the class is by forming a large clique. In the 1970s, Erdős conjectured that intersectio…