Two point concentration of maximum degree in sparse random planar graphs

MaRDI QIDQ6352483zbMATH OpenFDO

Authors Mihyun Kang, Michael Missethan

Publication date 28 October 2020

Mathematics Subject Classification ID

Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10) Random graphs (graph-theoretic aspects) (05C80)

Abstract: Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $left1,ldots,night$ with $m=m(n)$ edges. We show that in the sparse regime, when $limsu{p}_{noinfty}m/n<1$, with high probability the maximum degree of $P(n,m)$ takes at most two different values.

This page was built for publication: Two point concentration of maximum degree in sparse random planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6352483)