Asymptotic enumeration and limit laws of planar graphs

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.

14 pages

Cited by in corpus (1)

• The structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs