A simple proof of a $(p,2)$-theorem for non-piercing regions
By: Chaya Keller, Shakhar Smorodinsky
Potential Business Impact:
Finds fewer points to cover many shapes.
A family of sets satisfies the $(p,2)$-property if among any $p$ sets in the family, some two intersect. Two recent works used elaborate geometric techniques to show that any family of non-piercing regions in the plane that satisfies the $(p,2)$-property can be pierced by $O(p^9)$ points. In this note we show that even in a much more general setting, piercing by $O(p)$ points can be deduced from known results on hypergraphs with a hereditarily linear Delaunay graph, which include intersection hypergraphs of non-piercing regions.
Similar Papers
No Infinite $(p,q)$-Theorem for Piercing Compact Convex Sets with Lines in $\mathbb{R}^3$
Combinatorics
Finds a line that hits many shapes.
No Infinite $(p,q)$-Theorem for Piercing Compact Convex Sets with Lines in $\mathbb{R}^3$
Combinatorics
Lines can't always "pierce" all shapes.
Crossing and non-crossing families
Combinatorics
Find many crossing lines or special groups of points.