Intersection properties of boxes. II: Extremal families

DOI10.1007/BF02772945zbMath0747.52006MaRDI QIDQ1182651

Jürgen Eckhoff

Publication date: 28 June 1992

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

zbMATH Keywords

intersection graphboxesKalai familiesupper-bound theorem

Mathematics Subject Classification ID

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

Related Items

The Upper‐Bound Theorem for Families of Boxes in ℝ ^d , Quantitative combinatorial geometry for concave functions, Helly-type problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection patterns of convex sets
• Separating subgraphs in k-trees: Cables and caterpillars
• An upper-bound theorem for families of convex sets
• Intersection properties of boxes. I: An upper-bound theorem
• A characterization of Robert's inequality for boxicity
• On intersections of interval graphs
• Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen.
• Extremal interval graphs
• The maximum numbers of faces of a convex polytope
• Properties and characterizations of k ‐trees
• On the theory of graphs