Polytopes with few vertices and few facets
From MaRDI portal
Publication:285070
DOI10.1016/J.JCTA.2016.04.001zbMATH Open1341.52021arXiv1503.04129OpenAlexW2963290197MaRDI QIDQ285070FDOQ285070
Authors: Arnau Padrol
Publication date: 18 May 2016
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: In this note we prove that the number of combinatorial types of -polytopes with vertices and facets is bounded by a constant independent of .
Full work available at URL: https://arxiv.org/abs/1503.04129
Recommendations
Cites Work
- Counting \(d\)-polytopes with \(d+3\) vertices
- Many neighborly polytopes and oriented matroids
- Title not available (Why is that?)
- Convex Polytopes
- Neighborly polytopes
- A lost counterexample and a problem on illuminated polytopes
- Incidence graphs and unneighborly polytopes
- Minimal Positive 2-Spanning Sets of Vectors
- Title not available (Why is that?)
- Inner illumination of convex polytopes
- Gale diagrams of convex polytopes and positive spanning sets of vectors
Cited In (15)
- Equivelar polyhedra with few vertices
- On Dantzig figures from graded lexicographic orders
- A bound for the number of vertices of a polytope with applications
- There are asymptotically far fewer polytopes than we thought
- Vertex-facet incidences of unbounded polyhedra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Facets with fewest vertices
- Convex Bodies with Few Faces
- Title not available (Why is that?)
- Title not available (Why is that?)
- The maximum number of complementary facets of a simplicial polytope
- Vertex-facet assignments for polytopes
- Triangle-free polytopes with few facets
- Extension complexity of polytopes with few vertices or facets
This page was built for publication: Polytopes with few vertices and few facets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285070)