arXiv Analytics

Sign in

arXiv:math/0501269 [math.CO]AbstractReferencesReviewsResources

Asymptotic enumeration and limit laws of planar graphs

Omer Gimenez, Marc Noy

Published 2005-01-18, updated 2005-07-14Version 2

We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.

Comments: 14 pages
Categories: math.CO
Subjects: 05A16, 05C30
Related articles: Most relevant | Search more
arXiv:2007.08274 [math.CO] (Published 2020-07-16)
Asymptotic Enumeration and Limit Laws for Multisets: the Subexponential Case
arXiv:0909.3321 [math.CO] (Published 2009-09-17)
Asymptotic enumeration of correlation-immune boolean functions
arXiv:1303.4218 [math.CO] (Published 2013-03-18, updated 2013-09-22)
Asymptotic enumeration of sparse multigraphs with given degrees

Links

Toolbox