An upper-bound theorem for families of convex sets

DOI10.1007/BF00181472zbMath0588.52012OpenAlexW2127566659MaRDI QIDQ1073349

Jürgen Eckhoff

Publication date: 1985

Published in: Geometriae Dedicata (Search for Journal in Brave)

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

zbMATH Keywords

complexesfamily of convex setsUpper-bound theorem

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (22)

Bounding the piercing number ⋮ A note on the colorful fractional Helly theorem ⋮ Improved bounds on the Hadwiger-Debrunner numbers ⋮ Intersection properties of boxes. I: An upper-bound theorem ⋮ Piercing convex sets ⋮ Combinatorial properties of nonarchimedean convex sets ⋮ Fractional Helly theorem for Cartesian products of convex sets ⋮ Intersection patterns of planar sets ⋮ The Upper‐Bound Theorem for Families of Boxes in ℝ ^d ⋮ Helly’s theorem: New variations and applications ⋮ Nerves, minors, and piercing numbers ⋮ Helly-Type Theorems in Property Testing ⋮ Large cliques in hypergraphs with forbidden substructures ⋮ Intersection properties of boxes. II: Extremal families ⋮ Quantitative fractional Helly and \((p,q)\)-theorems ⋮ Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem ⋮ Radon numbers and the fractional Helly theorem ⋮ Quantitative combinatorial geometry for concave functions ⋮ Matchings and covers in hypergraphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Helly-type problems ⋮ Transversal numbers for hypergraphs arising in geometry

This page was built for publication: An upper-bound theorem for families of convex sets