Revisiting Mayer: Symmetric solutions for sporadic cases of the Map Color Theorem
Timothy Sun

TL;DR
This paper revisits Mayer's solutions for specific cases of the Map Color Theorem, providing new embeddings for K18 and K23 using current graph theory, and improving understanding of these sporadic cases.
Contribution
It offers a new interpretation of Mayer's solutions through current graph theory and presents improved embeddings for K18 and K23.
Findings
New embeddings for K18 and K23 graphs.
Interpretation of Mayer's solutions via current graphs.
Enhanced understanding of sporadic cases in the Map Color Theorem.
Abstract
The original proof of the genus of the complete graphs depended on Mayer's \emph{ad hoc} solutions for . Recently, an improved solution for 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 and .
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
Topicsgraph theory and CDMA systems · Graph theory and applications · Graph Labeling and Dimension Problems
