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

Abstract

The original proof of the genus of the complete graphs Kn depended on Mayer's ad hoc solutions for n = 18, 20, 23. Recently, an improved solution for K20 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 K18 and K23.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…