A lower bound theorem for polytope pairs

DOI10.1016/0097-3165(85)90068-8zbMath0598.52005OpenAlexW2144723754MaRDI QIDQ1079814

M. R. Emamy-Khansary

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90068-8

zbMATH Keywords

simple d-polytopepair of polytopestruncation-polytopeupper bound of vertices

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

Related Items (1)

A lower bound theorem for polytope pairs

Cites Work

• A lower bound theorem for polytope pairs
• Polytope pairs and their relationship to linear programming
• A comparison of primal and dual methods of linear programming
• The minimum number of vertices of a simple polytope
• A proof of the lower bound conjecture for convex polytopes
• Incidence graphs of convex polytopes
• A generalized lower‐bound conjecture for simplicial polytopes
• Unnamed Item

This page was built for publication: A lower bound theorem for polytope pairs