The asymptotic enumeration of rooted convex polyhedra

DOI10.1016/0095-8956(84)90033-9zbMath0527.05038OpenAlexW2016640915MaRDI QIDQ595676

Edward A. Bender, L. Bruce Richmond

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90033-9

zbMATH Keywords

asymptotic formularooted c-nets

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 (7)

Face sizes of 3-polytopes ⋮ Asymptotic enumeration and limit laws for graphs of fixed genus ⋮ Submaps of maps. I: General 0-1 laws ⋮ Degree distribution in random planar graphs ⋮ Uniform random sampling of planar graphs in linear time ⋮ The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces ⋮ A survey of the asymptotic behaviour of maps

Cites Work

• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Central and local limit theorems applied to asymptotic enumeration
• The Number of Rooted Convex Polyhedra
• The Asymptotic Number of Convex Polyhedra
• Asymptotic Methods in Enumeration
• The enumeration of c-nets via quadrangulations
• A Census of Planar Maps
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The asymptotic enumeration of rooted convex polyhedra