Skip to main content
Log in

The dimension of intersections of convex sets II

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

The subject of this paper is a Helly type theorem which solves the following problem: Find the smallest number β= β(j,k,n) having the following property: IfG is any finite family ofβ + 1 convex sets in Euclideann-space and if the intersection of everyβ members ofG is at leastk-dimensional, then the intersection of all members ofG is at leastj-dimensional.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. Danzer, B. Grünbaum and V. Klee,Helley’s theorem and its relatives, Proceedings of Symposia in Pure Mathematics, Vol. 7,Convexity. Amer. Math. Soc. (1962), 101–180.

  2. B.Grünbaum,The dimension of intersections of convex sets. Pacific J. Math.12 (1962), 197–202.

    MATH  MathSciNet  Google Scholar 

  3. M. Katchalski,The dimension of intersections of convex sets, Israel J. Math.10 (1971), 465–470.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Katchalski, M. The dimension of intersections of convex sets II. Israel J. Math. 26, 209–213 (1977). https://doi.org/10.1007/BF03007642

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03007642

Keywords

Navigation