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

DOI10.1112/S002557930000574XzbMATH Open0288.52004MaRDI QIDQ4776517FDOQ4776517

Authors: Peter McMullen 

Publication date: 1974

Published in: Mathematika (Search for Journal in Brave)

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx)

Cites Work

• On the upper-bound conjecture for convex polytopes

Cited In (5)

• Mittlere Schattengrenzenlänge konvexer Körper
• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• Gale diagrams of convex polytopes and positive spanning sets of vectors
• Enumerating neighborly polytopes and oriented matroids
• The enumeration of stack polytopes and simplicial clusters

This page was built for publication: The number of 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 Q4776517)