The number of simplicial neighbourly d ‐polytopes with d +3 vertices
From MaRDI portal
Publication:4771791
Cites work
- A theorem on cyclic polytopes
- An enumeration of simplicial 4-polytopes with 8 vertices
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- Neighborly 4-polytopes with 9 vertices
- On the upper-bound conjecture for convex polytopes
- Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes
Cited in
(7)- Neighborly 6-polytopes with 10 vertices
- Small covers and quasitoric manifolds over neighborly polytopes
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- On the Monotone Upper Bound Problem
- Simplicial neighbourly 5-polytopes with nine vertices
- Enumerating neighborly polytopes and oriented matroids
- One-point suspensions and wreath products of polytopes and spheres
This page was built for publication: The number of simplicial neighbourly d ‐polytopes with d +3 vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4771791)
