Intersection properties of boxes. II: Extremal families

DOI10.1007/BF02772945MaRDI QIDQ1182651zbMATH OpenFDO

Authors Jürgen Eckhoff

Publication date 28 June 1992

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

Full work available at URL https://doi.org/10.1007/BF02772945

zbMATH Keywords

boxesintersection graphKalai familiesupper-bound theorem

Mathematics Subject Classification ID

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

Review text

Une boîte de \(\mathbb{R}^ d\) est un produit cartésien de \(n\) convexes fermés de \(\mathbb{R}\), tous non rides. A une famille \(\mathcal P\) de boîtes de \(\mathbb{R}^ d\) est associée une suite de nombres entiers décrivant le comportement des sous-familles de \(\mathcal P\) relativement à la propriété d'intersection. Dans une famille de Kalai les boîtes sont des translatés des hyperplans de coordonnées on \(\mathbb{R}^ d\) lui- même. L'auteur dans cet article [voir aussi pour la partie I, Isr. J. Math. 62, 283-301 (1988; Zbl 0653.52003)] étudie géométriquement et caractérise les familles \(\mathcal P\) qui ont un comportement analogue à celui d'une famille de Kalai. Cet article est également bien situé dans le cadre de la théorie des graphes (Turan, Zykov) et des théorèmes de majoration de la géométrie combinatoire (McMullen, Kalai et l'auteur).

Recommendations

• Intersection properties of boxes. I: An upper-bound theorem
• The Upper‐Bound Theorem for Families of Boxes in ℝ ^d
• Extremal Results on Intersection Graphs of Boxes in $${\mathbb R}^d$$ R d
• A fractional Helly theorem for boxes
• New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)

Cites work

• A characterization of Robert's inequality for boxicity
• An upper-bound theorem for families of convex sets
• Extremal interval graphs
• scientific article; zbMATH DE number 3307331 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• Intersection patterns of convex sets
• Intersection properties of boxes. I: An upper-bound theorem
• On intersections of interval graphs
• On the theory of graphs
• Properties and characterizations of k ‐trees
• Separating subgraphs in k-trees: Cables and caterpillars
• The maximum numbers of faces of a convex polytope
• Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen.

Cited in

(8)

• Intersection properties of boxes. I: An upper-bound theorem
• Quantitative combinatorial geometry for concave functions
• The Upper‐Bound Theorem for Families of Boxes in ℝ ^d
• A survey and recent results about commmon developments of two or more boxes
• Extremal Results on Intersection Graphs of Boxes in $${\mathbb R}^d$$ R d
• Helly-type problems
• Extensions of discrete Helly theorems for boxes
• A note on the intersection property for flat boxes and boxicity in \(\mathbb R^d\)

This page was built for publication: Intersection properties of boxes. II: Extremal families

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