Mathematika · 1970 · 585 citations · 6 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsGeometryConvex AnalysisConvex GeometryPolyhedral CombinatoricsPolyhedron Theory
In this paper we give a proof of the long-standing Upper-bound Conjecture for convex polytopes, which states that, for 1 ≤ j < d < v, the maximum possible number of j-faces of a d-polytope with v vertices is achieved by a cyclic polytope C(v, d).
6
A Combinatorial Analogue of Poincaré's Duality Theorem
Victor Klee · Canadian Journal of Mathematics · 1964 · 140 citations · Full text
On the Number of Vertices of a Convex Polytope
Victor Klee · Canadian Journal of Mathematics · 1964 · 69 citations · Full text
On The Number of Faces of a Convex Polytope
David Gale · Canadian Journal of Mathematics · 1964 · 27 citations · Full text