2 papers
math.CO2025
Burling graphs in graphs with large chromatic number
Tara Abrishami, Marcin BriaÅski, James Davies +4
A graph class is -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 intersect…
math.CO2024
A survey of degree-boundedness
Xiying Du, Rose McCarty
Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-bounded…