A Simple Proof of the Upper Bound Theorem
- 1 September 1985
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 6 (3) , 211-214
- https://doi.org/10.1016/s0195-6698(85)80029-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An Extremal Problem for two Families of SetsPublished by Elsevier ,2013
- Intersection patterns of convex setsIsrael Journal of Mathematics, 1984
- Combinatorial methods in the theory of Cohen-Macaulay ringsAdvances in Mathematics, 1980
- A dual proof of the upper bound conjecture for convex polytopes.MATHEMATICA SCANDINAVICA, 1980
- Schälbare Cohen-Macauley-Komplexe und ihre ParametrisierungMathematische Zeitschrift, 1979
- d-Collapsing and nerves of families of convex setsArchiv der Mathematik, 1975
- The Upper Bound Conjecture and Cohen‐Macaulay RingsStudies in Applied Mathematics, 1975
- Shellable Decompositions of Cells and Spheres.MATHEMATICA SCANDINAVICA, 1971
- The maximum numbers of faces of a convex polytopeMathematika, 1970