Asymptotic enumeration and limit laws of planar graphs
classification
🧮 math.CO
keywords
graphsnumberplanarasymptoticlawslimitcomponentsconnected
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.