Intersection properties of boxes. I: An upper-bound theorem

DOI10.1007/BF02783298zbMath0653.52003MaRDI QIDQ1107826

Jürgen Eckhoff

Publication date: 1988

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

convex setboxesHelly theorem

Mathematics Subject Classification ID

Helly-type theorems and geometric transversal theory (52A35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

Fractional Helly theorem for Cartesian products of convex sets, The Upper‐Bound Theorem for Families of Boxes in ℝ ^d , On a conjecture by Kalai, Intersection properties of boxes. II: Extremal families, Face vectors of flag complexes, Turán and Ramsey Properties of Subcube Intersection Graphs, A Kruskal-Katona type theorem for graphs, Quantitative combinatorial geometry for concave functions, Discrete quantitative Helly-type theorems with boxes, Helly-type problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection patterns of convex sets
• The structure of rectangle families dividing the plane into maximum number of atoms
• Intersection properties of boxes in \(R^ n\).
• A simple proof of the upper bound theorem
• An upper-bound theorem for families of convex sets
• The maximum number of q-cliques in a graph with no p-clique
• A Turan type problem for interval graphs
• Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner
• On a Coloring Problem.
• A Problem of Geometry in R n
• Boxes in Rⁿ —A ‘Fractional’ Theorem
• The maximum numbers of faces of a convex polytope
• Sur l'indépendance de domaines simples dans l'espace euclidien à n dimensions
• On the theory of graphs