1 citations · 2 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2025★ 1 cited
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 intersectio…
math.CO2024★ 1 cited
Polynomial-time recognition and maximum independent set in Burling graphs
Paweł Rzążewski, Bartosz Walczak
A Burling graph is an induced subgraph of some graph in Burling's construction of triangle-free high-chromatic graphs. Equivalently, a Burling graph is a graph that admits a so-cal…