English

Piercing convex sets

Metric Geometry 2016-09-06 v1

Abstract

A family of sets has the (p,q)(p,q) property if among any pp members of the family some qq have a nonempty intersection. It is shown that for every pqd+1p\ge q\ge d+1 there is a c=c(p,q,d)<c=c(p,q,d)<\infty such that for every family \scrF\scr F of compact, convex sets in RdR^d that has the (p,q)(p,q) property there is a set of at most cc points in RdR^d that intersects each member of \scrF\scr F. This extends Helly's Theorem and settles an old problem of Hadwiger and Debrunner.

Keywords

Cite

@article{arxiv.math/9210213,
  title  = {Piercing convex sets},
  author = {Noga Alon and Daniel J. Kleitman},
  journal= {arXiv preprint arXiv:math/9210213},
  year   = {2016}
}

Comments

5 pages