Discrete Mathematics & Theoretical Computer Science 
We prove that for each $k \geq 0$, the probability that a root vertex in a random planar graph has degree $k$ tends to a computable constant $d_k$, and moreover that $\sum_k d_k =1$. The proof uses the tools developed by Gimènez and Noy in their solution to the problem of the asymptotic enumeration of planar graphs, and is based on a detailed analysis of the generating functions involved in counting planar graphs. However, in order to keep track of the degree of the root, new technical difficulties arise. We obtain explicit, although quite involved expressions, for the coefficients in the singular expansions of interest, which allow us to use transfer theorems in order to get an explicit expression for the probability generating function $p(w)=\sum_k d_k w^k$. From the explicit expression for $p(w)$ we can compute the $d_k$ to any degree of accuracy, and derive asymptotic estimates for large values of $k$.
Source : ScholeXplorer
IsRelatedTo ARXIV 1003.4699 Source : ScholeXplorer IsRelatedTo DOI 10.1137/100790161 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1003.4699 Source : ScholeXplorer IsRelatedTo HANDLE 2117/104308
