Coloring intersection hypergraphs of pseudo-disks
Bal\'azs Keszegh

TL;DR
This paper proves new coloring bounds for intersection hypergraphs of pseudo-disks, showing they can be properly colored with 4 colors and conflict-free colored with O(log n) colors, generalizing previous results.
Contribution
It introduces novel bounds for coloring intersection hypergraphs of pseudo-disks and regions with linear union complexity, extending and strengthening prior work.
Findings
Proper coloring with 4 colors for pseudo-disk intersection hypergraphs
Conflict-free coloring with O(log n) colors for the same hypergraphs
Planarity of the associated Delaunay-graph
Abstract
We prove that the intersection hypergraph of a family of pseudo-disks with respect to another family of pseudo-disks admits a proper coloring with colors and a conflict-free coloring with colors. Along the way we prove that the respective Delaunay-graph is planar. We also prove that the intersection hypergraph of a family of regions with linear union complexity with respect to a family of pseudo-disks admits a proper coloring with constantly many colors and a conflict-free coloring with colors. Our results serve as a common generalization and strengthening of many earlier results, including ones about proper and conflict-free coloring points with respect to pseudo-disks, coloring regions of linear union complexity with respect to points and coloring disks with respect to disks.
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.
