NewEvery arXiv paper, its researchers & institutions — mapped.
paper

The maximum degree of planar graphs I. Series-parallel graphs

arXiv:1008.5361

Abstract

We prove that the maximum degree $Δ_n$ of a random series-parallel graph with $n$ vertices satisfies $Δ_n/\log n \to c$ in probability, and $\mathbb{E}\, Δ_n \sim c \log n$ for a computable constant $c>0$. The same result holds for outerplanar graphs.

38 pages