The number of d ‐polytopes with d +3 vertices

DOI10.1112/S0025579300002795zbMATH Open0214.02901MaRDI QIDQ5616183FDOQ5616183

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

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

Cited In (6)

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

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)