On The Number of Faces of a Convex Polytope

DOI10.4153/CJM-1964-002-xzbMath0128.17103WikidataQ89047589 ScholiaQ89047589MaRDI QIDQ5335880

David Gale

Publication date: 1964

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items

Bounds on the number of compatible \(k\)-simplices matching the orientation of the \((k-1)\)-skeleton of a simplex, Heights of convex polytopes, The maximum numbers of faces of a convex polytope, The complexity of linear programming, Polytope pairs and their relationship to linear programming, An algorithm for enumerating all vertices of a convex polyhedron, A comparison of primal and dual methods of linear programming, The \(d\)-step conjecture for polyhedra of dimension \(d<6\), Unambiguous polyhedral graphs, On the upper-bound conjecture for convex polytopes, The Shifted Turán Sieve Method on Tournaments