Year: 2025
Type: preprint
Abstract: We show that there exist infinitely many classes of intersection graphs of geometric objects that are not $χ$-bounded -- namely, $d$-CBU graphs for $d\geq 3$ -- and each is incomparable with the class of Burling graphs. This answers a folklore open problem on whether Burling graphs are the sole source of unbounded chromatic number among geometric intersection classes.
Source: arXiv (Cornell University)
Author: Pournajafi, Pegah
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4416839772
Cites:
Cited by:
Related to: