Exponentially many genus embeddings of the complete graph \(K_{12s+3}\) (Q2355353)

The (orientable) maximum genus of a graph \(G\) is the maximum genus of an orientable surface for which a 2-cell embedding of the graph \(G\) exists. This paper provides a lower bound for the number of orientable maximum genus embeddings for a particular type of complete graphs. Theorem: For \(s\) sufficiently large, the complete graph \(K_{12s + 3}\) has at least \(\frac{1}{2}\times \left ( \frac{200}{9}\right ) ^s\) distinct genus embeddings in surfaces.