再访Mayer：地图颜色定理的偶发情形的对称解
Revisiting Mayer: Symmetric solutions for sporadic cases of the Map Color Theorem
摘要：
完全图$K_n$的亏格的最初证明依赖于$n = 18, 20, 23$的Mayer \emph{ad hoc}解。最近，作者发现了一种改进的解决方案$K_{20}$。本文的目的是利用电流图理论来解释上述结果，并提供新的嵌入$K_{18}$和$K_{23}$。
英文摘要：
The original proof of the genus of the complete graphs $K_n$ depended on Mayer's \emph{ad hoc} solutions for $n = 18, 20, 23$. Recently, an improved solution for $K_{20}$ was found by the author. The purpose of this note is to use the theory of current graphs to interpret the aforementioned result and to provide new embeddings of $K_{18}$ and $K_{23}$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
