Expected degrees in random plane graphs

Neely Lovvorn, Oscar Murillo-Espinoza, Adam Sheffer

We prove that, for every set of $n$ points $\mathcal{P}$ in ${\mathbb{R}}^2$, a random plane graph drawn on $\mathcal{P}$ is expected to contain less than $n/10.18$ isolated vertices…