Lower bounds for piercing and coloring boxes
Istv\'an Tomon

TL;DR
This paper establishes new lower bounds for the piercing and coloring numbers of axis-parallel boxes in higher dimensions, matching or nearly matching known upper bounds and advancing understanding of geometric intersection graphs.
Contribution
It constructs families of boxes that achieve near-optimal bounds for piercing and coloring numbers, resolving longstanding questions in geometric combinatorics.
Findings
Constructs families of boxes with large piercing numbers relative to independence numbers.
Provides intersection graphs with clique and independence numbers close to theoretical bounds.
Develops bounds on chromatic numbers of box intersection graphs for various clique sizes.
Abstract
Given a family of axis-parallel boxes in , let denote its piercing number, and its independence number. It is an old question whether can be arbitrarily large for given . Here, for every , we construct a family of axis-parallel boxes achieving This not only answers the previous question for every positively, but also matches the best known upper bound up to double-logarithmic factors. Our main construction has further implications about the Ramsey and coloring properties of configurations of boxes as well. We show the existence of a family of boxes in , whose intersection graph has clique and independence number This is the first improvement…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory
