The genus of the Erd\H{o}s-R\'enyi random graph and the fragile genus property
Chris Dowden, Mihyun Kang, and Michael Krivelevich

TL;DR
This paper analyzes the genus of Erdős-Rényi random graphs across different regimes of edge density, revealing phase transitions and demonstrating the fragile nature of genus under small random perturbations.
Contribution
It provides a detailed characterization of the genus in various regimes of Erdős-Rényi graphs and introduces the concept of fragile genus, showing how small random edge additions can dramatically increase genus.
Findings
Genus is approximately m/2 when m is between n and n^{1+o(1)}.
Genus scales with a function μ(λ) for m ~ λn, λ > 1/2.
Adding a small number of edges to a bounded degree graph can increase genus to Ω(n).
Abstract
We investigate the genus of the Erd\H{o}s-R\'enyi random graph , providing a thorough description of how this relates to the function , and finding that there is different behaviour depending on which `region' falls into. Results already exist for and for , and so we focus on the intermediate cases. We establish that whp (with high probability) when , that whp for a given function when for , and that whp when for . We then also show that the genus of a fixed graph can increase dramatically if a small number of random edges are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Stochastic processes and statistical mechanics
