The number of simplicial neighbourly d ‐polytopes with d +3 vertices

DOI10.1112/S0025579300004873zbMATH Open0284.52001MaRDI QIDQ4771791FDOQ4771791

Authors: Amos Altshuler, Peter McMullen 

Publication date: 1973

Published in: Mathematika (Search for Journal in Brave)

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx)

Cites Work

• Neighborly 4-polytopes with 9 vertices
• An enumeration of simplicial 4-polytopes with 8 vertices
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes
• On the upper-bound conjecture for convex polytopes
• A theorem on cyclic 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)