The number of simplicial neighbourly d ‐polytopes with d +3 vertices
From MaRDI portal
Publication:4771791
DOI10.1112/S0025579300004873zbMath0284.52001MaRDI QIDQ4771791
Amos Altshuler, Peter McMullen
Publication date: 1973
Published in: Mathematika (Search for Journal in Brave)
Related Items
On the Monotone Upper Bound Problem, Enumerating Neighborly Polytopes and Oriented Matroids, Realizability and inscribability for simplicial polytopes via nonlinear optimization, One-point suspensions and wreath products of polytopes and spheres, Neighborly 6-polytopes with 10 vertices, Simplicial neighbourly 5-polytopes with nine vertices, Small covers and quasitoric manifolds over neighborly polytopes
Cites Work
- Neighborly 4-polytopes with 9 vertices
- On the upper-bound conjecture for convex polytopes
- A theorem on cyclic polytopes
- Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- An enumeration of simplicial 4-polytopes with 8 vertices
