A note on -unbounded classes of geometric graphs
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≥ 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.