Minimum number of edges of polytopes with \(2d+2\) vertices

DOI10.37236/10374OpenAlexW3024548395WikidataQ114023890 ScholiaQ114023890MaRDI QIDQ2161204

David Yost, Guillermo Pineda-Villavicencio, Julien Ugon

Publication date: 4 August 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Related Items (1)

The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices

Cites Work

• Unnamed Item
• Indecomposable polytopes
• On the reconstruction of polytopes
• Complete enumeration of small realizable oriented matroids
• A proof of Grünbaum's lower bound conjecture for general polytopes
• Polytopes close to being simple
• Lower bound theorems for general polytopes
• Decomposability of polytopes
• A proof of the lower bound conjecture for convex polytopes
• Lectures on Polytopes
• Convex Polytopes
• The Excess Degree of a Polytope
• More indecomposable polyhedra
• The Minimum Number of Facets of a Convex Polytope
• Decomposable convex polyhedra

This page was built for publication: Minimum number of edges of polytopes with \(2d+2\) vertices