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

2018/03/25 by Timothy Sun, Sun, Timothy
Computer Science · Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1803.09207

openalex publication_date 2018/03/25 · openalex created_date 2018/04/06 · openalex updated_date 2026/07/28

Abstract

The original proof of the genus of the complete graphs K_n depended on Mayer's ad hoc solutions for n = 18, 20, 23. Recently, an improved solution for K₂₀ 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₁₈ and K₂₃.

Citations

• Face distributions of embeddings of complete graphs

Related

• Revisiting Cases 2 and 11 of the Map Color Theorem
• Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
• Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
• Z₂-genus of graphs and minimum rank of partial symmetric matrices
• Finite subgraphs of uncountably chromatic graphs