The Upper‐Bound Theorem for Families of Boxes in ℝ d

DOI10.1112/S0025579300000176zbMATH Open1175.52006MaRDI QIDQ3515262FDOQ3515262

Authors: Jürgen Eckhoff 

Publication date: 29 July 2008

Published in: Mathematika (Search for Journal in Brave)

Recommendations

• Intersection properties of boxes. I: An upper-bound theorem
• An upper-bound theorem for families of convex sets
• Intersection properties of boxes. II: Extremal families
• New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)
• A fractional Helly theorem for boxes

zbMATH Keywords

clique numberintersection graphaxis-aligned parallelotopes

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Other problems of combinatorial convexity (52A37)

Cites Work

• An upper-bound theorem for families of convex sets
• Intersection patterns of convex sets
• Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
• Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions
• Extremal interval graphs
• A simple proof of the upper bound theorem
• Intersection properties of boxes. I: An upper-bound theorem
• Face vectors of flag complexes
• Intersection properties of boxes. II: Extremal families

Cited In (8)

• Independent collections of translates of boxes and a conjecture due to Grünbaum
• On the volume set of boxes in finite spaces
• Stabbing boxes with finitely many axis-parallel lines and flats
• A fractional Helly theorem for boxes
• An upper-bound theorem for families of convex sets
• Intersection properties of boxes. I: An upper-bound theorem
• How many atoms can be defined by boxes ?
• New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)

This page was built for publication: The Upper‐Bound Theorem for Families of Boxes in ℝ ^d

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515262)