The genus of a random graph
The minimum number of handles (crosscaps) needed to embed a graph on an orientable (nonorientable) surface is shown to be close to \(pn^2/12\) \((pn^2/6)\) for almost every random graph of order \(n\) with edge probability \(p\).
scientific article; zbMATH DE number 790747
scientific article