A simple proof of the upper bound theorem

DOI10.1016/S0195-6698(85)80029-9zbMath0582.52003WikidataQ100329018 ScholiaQ100329018MaRDI QIDQ1068364

Gil Kalai, Noga Alon

Publication date: 1985

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

shellability(m,s)-collapsupper bound theorem for convex polytopes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Polytopes and polyhedra (52Bxx)

Related Items

Combinatorics in the exterior algebra and the Bollobás Two Families Theorem, Inequalities for two set systems with prescribed intersections, Bounding the piercing number, Improved bounds on the Hadwiger-Debrunner numbers, On the kernel of intersecting families, Intersection properties of boxes. I: An upper-bound theorem, Piercing convex sets, Interview with Gil Kalai, On the running time of hypergraph bootstrap percolation, Topology of complements of skeletons, Fractional Helly theorem for Cartesian products of convex sets, The Upper‐Bound Theorem for Families of Boxes in ℝ ^d , Remarks on the upper bound theorem., Helly-Type Theorems in Property Testing, Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem, On face numbers of manifolds with symmetry, Extremal interval graphs, A generalization of the Bollobás set pairs inequality, Complexes of graphs with bounded independence number, Matchings and covers in hypergraphs, Bollobás-type theorems for hemi-bundled two families, Intersection patterns of convex sets, An extremal problem for sets with applications to graph theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection patterns of convex sets
• An extremal problem for sets with applications to graph theory
• Combinatorial methods in the theory of Cohen-Macaulay rings
• An extremal problem for two families of sets
• d-collapsing and nerves of families of convex sets
• A dual proof of the upper bound conjecture for convex polytopes.
• The Upper Bound Conjecture and Cohen-Macaulay Rings
• The maximum numbers of faces of a convex polytope
• Shellable Decompositions of Cells and Spheres.
• Combinatorics and commutative algebra
• Schälbare Cohen-Macaulay-Komplexe und ihre Parametrisierung. (Shellable Cohen-Macaulay complexes and their parametrization)