The number of d ‐polytopes with d +3 vertices

DOI10.1112/S0025579300002795MaRDI QIDQ5616183zbMATH OpenFDO

Authors E. Keith Lloyd

Publication date 1970

Published in Mathematika (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Cites work

• Contributions to the Cell Growth Problem
• Convex Polytopes
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen

Cited in

(6)

• The enumeration of stack polytopes and simplicial clusters
• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• Complete enumeration of small realizable oriented matroids
• Gale diagrams of convex polytopes and positive spanning sets of vectors
• Polytopes, graphs, and complexes
• Counting polytopes via the Radon complex

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