Lower bound theorems for general polytopes

DOI10.1016/j.ejc.2018.12.003zbMath1423.52022arXiv1509.08218OpenAlexW2271061143WikidataQ128631632 ScholiaQ128631632MaRDI QIDQ2422227

Julien Ugon, David Yost, Guillermo Pineda-Villavicencio

Publication date: 18 June 2019

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

Full work available at URL: https://arxiv.org/abs/1509.08218

zbMATH Keywords

minimising polytopesnumber of dimensional faces of a polytope

Mathematics Subject Classification ID

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

Related Items

A proof of Grünbaum's lower bound conjecture for general polytopes, The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices, Minimum number of edges of polytopes with \(2d+2\) vertices, Polytopes close to being simple, The numbers of edges of 5-polytopes with a given number of vertices, Embedding divisor and semi-prime testability in \(f\)-vectors of polytopes, On the first two entries of the f-vectors of 6-polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Rigidity and the lower bound theorem. I
• Counting \(d\)-polytopes with \(d+3\) vertices
• Indecomposable convex polytopes
• Polyhedra with 4 to 8 faces
• The number of \(k\)-faces of a simple \(d\)-polytope
• Hamiltonian simple polytopes
• Decomposability of polytopes
• The minimum number of vertices of a simple polytope
• Lectures on Polytopes
• On a class of generalized simplices
• The Excess Degree of a Polytope
• More indecomposable polyhedra
• Convex Polytopes
• The Minimum Number of Facets of a Convex Polytope
• Polytopes, graphs, and complexes
• Decomposable convex polyhedra