Asymptotic enumeration of unlabelled cubic planar graphs
arXiv:2606.17992
Abstract
We determine the precise asymptotic number of unlabelled cubic planar graphs with vertices. Our approach blends generating series methods with computational bounds and probabilistic local large deviation theorems.