The minimum number of faces of a simple polyhedron

DOI10.1016/S0195-6698(80)80017-5zbMath0451.52004OpenAlexW2061450130MaRDI QIDQ1147993

Anders Bjoerner

Publication date: 1980

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(80)80017-5

zbMATH Keywords

number of facessimple d-polyhedron

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx)

Related Items

Lower-bound theorems for pseudomanifolds, The number of faces of polytope pairs and unbounded polyhedra, Rigidity and the lower bound theorem. I, Characterizing flag graphs and incuced subgraphs of Cartesian product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polytope pairs and their relationship to linear programming
• Shellings of spheres and polytopes
• A comparison of primal and dual methods of linear programming
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• A proof of the lower bound conjecture for convex polytopes