The asymptotic number of convex polyhedra

The asymptotic number of convex polyhedra
HTML articles powered by AMS MathViewer

by L. B. Richmond and N. C. Wormald PDF

Trans. Amer. Math. Soc. 273 (1982), 721-735 Request permission

We obtain an asymptotic formula for the number of combinatorially distinct convex polyhedra with $n$ edges.

References

William G. Brown, Enumeration of non-separable planar maps, Canadian J. Math. 15 (1963), 526–545. MR 150759, DOI 10.4153/CJM-1963-056-7

The number of polyhedra

30

Branko Grünbaum, Convex polytopes, Pure and Applied Mathematics, Vol. 16, Interscience Publishers John Wiley & Sons, Inc., New York, 1967. With the cooperation of Victor Klee, M. A. Perles and G. C. Shephard. MR 0226496
V. A. Liskovets, Enumeration of nonisomorphic planar maps, J. Graph Theory 5 (1981), no. 1, 115–117. MR 604312, DOI 10.1002/jgt.3190050110
P. Mani, Automorphismen von polyedrischen Graphen, Math. Ann. 192 (1971), 279–303 (German). MR 296808, DOI 10.1007/BF02075357
W. T. Tutte, The enumerative theory of planar maps, A survey of combinatorial theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971) North-Holland, Amsterdam, 1973, pp. 437–448. MR 0364004
W. T. Tutte, A census of planar maps, Canadian J. Math. 15 (1963), 249–271. MR 146823, DOI 10.4153/CJM-1963-029-x
W. T. Tutte, On the enumeration of convex polyhedra, J. Combin. Theory Ser. B 28 (1980), no. 2, 105–126. MR 572468, DOI 10.1016/0095-8956(80)90059-3
Nicholas C. Wormald, Counting unrooted planar maps, Discrete Math. 36 (1981), no. 2, 205–225. MR 675353, DOI 10.1016/0012-365X(81)90238-7
Nicholas C. Wormald, On the number of planar maps, Canadian J. Math. 33 (1981), no. 1, 1–11. MR 608849, DOI 10.4153/CJM-1981-001-6