An Upper Bound Theorem for Polytope Pairs

DOI10.1287/MOOR.11.3.451MaRDI QIDQ3742255zbMATH OpenOpenAlexFDO

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

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

0-sequencef-vectorfacetsh-vectorlinear programmingM-vectorMcMullen's conditionspolyhedronpolytope pairsimple polytopesimplicial complextriangulated sphereupper bound theorem

Mathematics Subject Classification ID

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

Recommendations

• A lower bound theorem for polytope pairs
• scientific article; zbMATH DE number 3923570
• scientific article; zbMATH DE number 697092
• The upper bound theorem for polytopes: An easy proof of its asymptotic version
• McMullen's conditions and some lower bounds for general convex polytopes

Cited in

(8)

• A lower bound theorem for polytope pairs
• The maximum number of complementary facets of a simplicial polytope
• Bounds on the number of vertices of perturbed polyhedra
• An upper bound on conductors for pairs
• The upper bound theorem for polytopes: An easy proof of its asymptotic version
• Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
• The merging operation and \((d-i)\)-simplicial \(i\)-simple \(d\)-polytopes
• Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices

This page was built for publication: An Upper Bound Theorem for Polytope Pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742255)