Asymptotic enumeration of unlabelled cubic planar graphs
Abstract
We determine the precise asymptotic number of unlabelled cubic planar graphs with n vertices. Our approach blends generating series methods with computational bounds and probabilistic local large deviation theorems.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.