The Asymptotic Number of Convex Polyhedra

DOI10.2307/1999938zbMath0496.05023OpenAlexW4236750455MaRDI QIDQ3960868

L. Bruce Richmond, Nicholas C. Wormald

Publication date: 1982

Full work available at URL: https://doi.org/10.2307/1999938

zbMATH Keywords

3-connected graphconvex polyhedraplanar maprooted nonseparable maps

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx)

Related Items (9)

Many triangulated spheres ⋮ The number of polytopes, configurations and real matroids ⋮ Face sizes of 3-polytopes ⋮ The asymptotic enumeration of rooted convex polyhedra ⋮ Realizability and inscribability for simplicial polytopes via nonlinear optimization ⋮ Face numbers: the upper bound side of the story ⋮ The complete enumeration of 4-polytopes and 3-spheres with nine vertices ⋮ Arithmetical semigroups related to trees and polyhedra ⋮ A survey of the asymptotic behaviour of maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting unrooted planar maps
• On the enumeration of convex polyhedra
• Automorphismen von polyedrischen Graphen
• Enumeration of nonisomorphic planar maps
• On the Tumber of Planar Maps
• A Census of Planar Maps
• Enumeration of Non-Separable Planar Maps

This page was built for publication: The Asymptotic Number of Convex Polyhedra