Two point concentration of maximum degree in sparse random planar graphs

Mihyun Kang, Michael Missethan

Published 2020-10-28Version 1

Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\left\{1, \ldots, n\right\}$ with $m=m(n)$ edges. We show that in the sparse regime, when $\limsup_{n \to \infty} m/n<1$, with high probability the maximum degree of $P(n,m)$ takes at most two different values.