Discrete & Computational Geometry

, Volume 39, Issue 4, pp 766–777 | Cite as

Piercing Families of Convex Sets with the d-Intersection Property in ℝ d

  • R. N. KarasevEmail author


In this paper, we consider finite families of convex sets in ℝ d such that every d or fewer sets of the family have a common point. For some families of this type, we give upper bounds on the size of a finite set intersecting all sets of the family.


Piercing Helly’s theorem Transversal 


  1. 1.
    Danzer, L., Grünbaum, B., Klee, V.: Helly’s theorem and its relatives. In: Convexity, Proc. of Symposia in Pure Math., vol. 7, pp. 101–180. Am. Math. Soc., Providence (1963) Google Scholar
  2. 2.
    Eckhoff, J.: Helly, Radon, and Carathéodory type theorems. In: Gruber, P.M., Willis, J.M. (eds.) Handbook of Convex Geometry, pp. 389–448. North-Holland, Amsterdam (1993) Google Scholar
  3. 3.
    Grünbaum, B.: On intersections of similar sets. Portugal. Math. 18, 155–164 (1959) MathSciNetzbMATHGoogle Scholar
  4. 4.
    Karasev, R.N.: Transversals for the families of translates of a two-dimensional convex compact set. Discrete Comput. Geom. 24(2/3), 345–353 (2000) CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    Polovinkin, E.S.: Strongly convex analysis. Russ. Acad. Sci. Sb. Math. 187(2), 103–130 (1996) MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Dept. of MathematicsMoscow Institute of Physics and TechnologyDolgoprudnyRussia

Personalised recommendations