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 ≥ q ≥ d + 1 there is a c = c(p, q, d) < ∞ such that for every family J of compact, convex sets in Rd which has the (p, q) property there is a set of at most c points in Rd that intersects each member of J. This settles an old problem of Hadwiger and Debrunner.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 103-112 |
| Number of pages | 10 |
| Journal | Advances in Mathematics |
| Volume | 96 |
| Issue number | 1 |
| DOIs | |
| State | Published - Nov 1992 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- General Mathematics
Fingerprint
Dive into the research topics of 'Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver