McMullen's conditions and some lower bounds for general convex polytopes

DOI10.1007/BF01263604zbMath0811.52004MaRDI QIDQ1337108

Komei Fukuda, Antoine Deza

Publication date: 2 May 1995

Published in: Geometriae Dedicata (Search for Journal in Brave)

zbMATH Keywords

lower boundscombinatorial propertiesnumber of verticessimplicial polytopes\(n\)-dimensional polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11)

Related Items (2)

On the number of vertices of the stochastic tensor polytope ⋮ Estimating the number of vertices of a polyhedron

Cites Work

• Unnamed Item
• Unnamed Item
• Underpolynomials and infrapolynomials
• The number of faces of a simplicial convex polytope
• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• The numbers of faces of simplicial polytopes
• The minimum number of vertices of a simple polytope
• A proof of the lower bound conjecture for convex polytopes
• Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes
• The maximum numbers of faces of a convex polytope

This page was built for publication: McMullen's conditions and some lower bounds for general convex polytopes