The Numbers of Faces of Polytope Pairs and Unbounded Polyhedra
- 1 December 1981
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 2 (4) , 307-322
- https://doi.org/10.1016/s0195-6698(81)80037-6
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopesJournal of Combinatorial Theory, Series A, 1981
- The Minimum Number of Faces of a Simple PolyhedronEuropean Journal of Combinatorics, 1980
- Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopesBulletin of the American Mathematical Society, 1980
- Polytope pairs and their relationship to linear programmingActa Mathematica, 1974
- A proof of the lower bound conjecture for convex polytopesPacific Journal of Mathematics, 1973
- Shellable Decompositions of Cells and Spheres.MATHEMATICA SCANDINAVICA, 1971
- The minimum number of vertices of a simple polytopeIsrael Journal of Mathematics, 1971
- The d-step conjecture for polyhedra of dimension d<6Acta Mathematica, 1967
- A comparison of primal and dual methods of linear programmingNumerische Mathematik, 1966
- A Combinatorial Analogue of Poincaré's Duality TheoremCanadian Journal of Mathematics, 1964