Minimum number of edges of polytopes with 2d + 2 vertices

DOI10.37236/10374arXiv2005.06746WikidataQ114023890 ScholiaQ114023890MaRDI QIDQ6340665FDOQ6340665

Authors: Guillermo Pineda-Villavicencio, Julien Ugon, David Yost 

Publication date: 14 May 2020

Abstract: We define an analogue of the cube and an analogue of the 5-wedge in higher dimensions, each with $2d+2$ vertices and $d^2+2d-3$ edges. We show that these two are the only minimisers of the number of edges, amongst d-polytopes with $2d+2$ vertices, for all $d$ except 4, 5 and 7. We also show that there are four sporadic minimisers in these low dimensions. We announce a partial solution to the corresponding problem for polytopes with $2d+3$ vertices.

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)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340665)