The genus of the Erdős-Rényi random graph and the fragile genus property

Abstract

We investigate the genus $g(n,m)$ of the Erdős-Rényi random graph $G(n,m)$, providing a thorough description of how this relates to the function $m=m(n)$, and finding that there is different behaviour depending on which `region' $m$ falls into. Results already exist for $m \le \frac{n}{2} + O(n^{2/3})$ and $m = ω\left( n^{1+\frac{1}{j}} \right)$ for $j \in \mathbb{N}$, and so we focus on the intermediate cases. We establish that $g(n,m) = (1+o(1)) \frac{m}{2}$ whp (with high probability) when $n \ll m = n^{1+o(1)}$, that $g(n,m) = (1+o(1)) μ(λ) m$ whp for a given function $μ(λ)$ when $m \sim λn$ for $λ> \frac{1}{2}$, and that $g(n,m) = (1+o(1)) \frac{8s^{3}}{3n^{2}}$ whp when $m = \frac{n}{2} + s$ for $n^{2/3} \ll s \ll n$. We then also show that the genus of a fixed graph can increase dramatically if a small number of random edges are added. Given any connected graph with bounded maximum degree, we find that the addition of $εn$ edges will whp result in a graph with genus $Ω(n)$, even when $ε$ is an arbitrarily small constant! We thus call this the `fragile genus' property.

24 pages