Author:
Bender Edward A.,Gao Zhicheng,Wormald Nicholas C.
Abstract
We derive the asymptotic expression for the number of labeled 2-connected planar graphs with respect to vertices and edges. We also show that almost all such graphs with $n$ vertices contain many copies of any fixed planar graph, and this implies that almost all such graphs have large automorphism groups.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Statistics of Feynman amplitudes in ϕ4-theory;Journal of High Energy Physics;2023-11-22
2. Enumeration of labelled 4-regular planar graphs II: Asymptotics;European Journal of Combinatorics;2023-05
3. Random cubic planar graphs converge to the Brownian sphere;Electronic Journal of Probability;2023-01-01
4. Перечисление помеченных непланарных пентациклических блоков;Итоги науки и техники. Серия «Современная математика и ее приложения. Тематические обзоры»;2021-03
5. Local Convergence of Random Planar Graphs;Trends in Mathematics;2021