Polytopes close to being simple

DOI10.1007/s00454-018-00053-yzbMath1441.52010arXiv1704.00854OpenAlexW2613641366MaRDI QIDQ2189745

Guillermo Pineda-Villavicencio, David Yost, Julien Ugon

Publication date: 16 June 2020

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

simple polytope\(k\)-skeletonreconstructibility from graphs

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 (4)

The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices ⋮ Reconstructibility of Matroid Polytopes ⋮ Minimum number of edges of polytopes with \(2d+2\) vertices ⋮ On the reconstruction of polytopes

Uses Software

• polymake

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the graph structure of convex polyhedra in \(n\)-space
• Puzzles and polytope isomorphisms
• A simple way to tell a simple polytope from its graph
• On the reconstruction of polytopes
• Complete enumeration of small realizable oriented matroids
• Lower bound theorems for general polytopes
• Convex Polytopes
• The Excess Degree of a Polytope
• More indecomposable polyhedra
• Decomposable convex polyhedra

This page was built for publication: Polytopes close to being simple