An Upper Bound Theorem for Polytope Pairs

DOI10.1287/moor.11.3.451zbMath0604.52001OpenAlexW2128647106MaRDI QIDQ3742255

Carl W. Lee, Peter Kleinschmidt, D. W. Barnette

Publication date: 1986

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.11.3.451

zbMATH Keywords

linear programmingpolyhedronsimplicial complexupper bound theoremfacetssimple polytopetriangulated spheref-vectorh-vectorMcMullen's conditionsM-vector0-sequencepolytope pair

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial inequalities (05A20) Polytopes and polyhedra (52Bxx)

Related Items

Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums, The maximum number of complementary facets of a simplicial polytope, Bounds on the number of vertices of perturbed polyhedra