The number of d ‐polytopes with d +3 vertices

DOI10.1112/S0025579300002795zbMath0214.02901MaRDI QIDQ5616183

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)

Related Items (6)

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

Cites Work

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

This page was built for publication: The number of d ‐polytopes with d +3 vertices