Coloring lines and Delaunay graphs with respect to boxes
Istv\'an Tomon

TL;DR
This paper demonstrates the existence of geometric configurations with high chromatic number and small independence number, using probabilistic methods to improve bounds in intersection and Delaunay graphs of lines, points, and boxes.
Contribution
It provides new constructions of geometric graphs with polynomial chromatic number and small independence number, improving previous bounds and extending known results to higher dimensions.
Findings
Constructed a family of lines with triangle-free intersection graph and high chromatic number.
Extended bounds on Delaunay graphs with respect to boxes to higher dimensions.
Improved the known lower bounds for chromatic number in geometric intersection graphs.
Abstract
The goal of this paper is to show the existence (using probabilistic tools) of configurations of lines, boxes, and points with certain interesting combinatorial properties. (i) First, we construct a family of lines in whose intersection graph is triangle-free of chromatic number . This improves the previously best known bound by Norin, and is also the first construction of a triangle-free intersection graph of simple geometric objects with polynomial chromatic number. (ii) Second, we construct a set of points in , whose Delaunay graph with respect to axis-parallel boxes has independence number at most . This extends the planar case considered by Chen, Pach, Szegedy, and Tardos.
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.
