arXiv · math/9210213
Piercing convex sets
Abstract
A family of sets has the $(p,q)$ property if among any $p$ members of the family some $q$ have a nonempty intersection. It is shown that for every $p\ge q\ge d+1$ there is a $c=c(p,q,d)<\infty$ such that for every family $\scr F$ of compact, convex sets in $R^d$ that has the $(p,q)$ property there is a set of at most $c$ points in $R^d$ that intersects each member of $\scr F$. This extends Helly's Theorem and settles an old problem of Hadwiger and Debrunner.
Explore related subjects
Keep this discovery
Noga Alon, Daniel J. Kleitman. 1992-10-01. Piercing convex sets. https://arxiv.org/abs/math/9210213
Cite the original work for its findings. Save a collection to share your selection of sources.