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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.