Polytopes with few vertices and few facets

DOI10.1016/j.jcta.2016.04.001zbMath1341.52021arXiv1503.04129OpenAlexW2963290197MaRDI QIDQ285070

Arnau Padrol

Publication date: 18 May 2016

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

convex polytopesnumber of combinatorial typesPerles' Skeleton theorem

Mathematics Subject Classification ID

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

Related Items (2)

On Dantzig figures from graded lexicographic orders ⋮ Extension Complexity of Polytopes with Few Vertices or Facets

Cites Work

• Many neighborly polytopes and oriented matroids
• Gale diagrams of convex polytopes and positive spanning sets of vectors
• Counting \(d\)-polytopes with \(d+3\) vertices
• Neighborly polytopes
• A Lost Counterexample and a Problem on Illuminated Polytopes
• Minimal Positive 2-Spanning Sets of Vectors
• Convex Polytopes
• Inner illumination of convex polytopes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polytopes with few vertices and few facets