Asymptotic enumeration of unlabelled cubic planar graphs

作者:

摘要 / Abstract

arXiv:2606.17992v1 Announce Type: cross 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.

同行评议区

登录学者账户后即可在此处发表评述或点赞。

立即登录

暂无评议记录。