pith. sign in

arxiv: 2509.06407 · v2 · submitted 2025-09-08 · 🧮 math.CO

Revisiting Cases 2 and 11 of the Map Color Theorem

Timothy Sun This is my paper

Pith reviewed 2026-05-18 18:49 UTC · model grok-4.3

classification 🧮 math.CO
keywords Map Color Theoremcurrent graphsgenus embeddingscomplete graphsRingel-Youngs methodtopological graph theoryvoltage graphs
0
0 comments X

The pith

Families of current graphs with simpler arc labelings complete the constructions for the Map Color Theorem when n is congruent to 2 or 11 modulo 12.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper seeks to simplify the original Ringel-Youngs constructions of genus embeddings for complete graphs K_n in the cases n congruent to 2 and 11 modulo 12. It does so by exhibiting families of current graphs whose arc labelings follow more regular, less intricate patterns than those used in 1968. A sympathetic reader would care because these embeddings determine the minimal genus needed to draw K_n without crossings, which in turn settles the chromatic number of surfaces and finishes the proof of the Map Color Theorem. If the new graphs work, they replace cumbersome case-by-case labelings with uniform families that are easier to verify and describe.

Core claim

For n ≡ 2, 11 (mod 12), there exist families of current graphs that satisfy the voltage and current conditions of the Ringel-Youngs method while using simpler, more patterned arc labelings than the constructions originally given by Ringel and Youngs.

What carries the argument

Families of current graphs whose arc labelings follow simpler repeating patterns that still meet the Kirchhoff-type current law and voltage assignment rules needed to produce the required triangular embeddings of K_n.

If this is right

  • The orientable Map Color Theorem receives a more uniform set of constructions across all residue classes modulo 12.
  • Verification of the embeddings for these two classes can be reduced to checking a small number of pattern rules rather than many separate diagrams.
  • The same families supply explicit rotation systems that realize the minimal genus for every sufficiently large K_n in these classes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same pattern-seeking approach might shorten proofs for the non-orientable Map Color Theorem or for other surface embeddings of complete graphs.
  • These simpler current graphs could serve as test cases for automated verification tools that check voltage assignments and current laws.

Load-bearing premise

The newly proposed current graphs must actually satisfy the voltage and current conditions required by the Ringel-Youngs method to generate embeddings of the claimed genus.

What would settle it

Explicitly construct the current graph for the smallest such n (for example n=14 or n=23) and check whether the resulting rotation system yields a 2-cell embedding of K_n on a surface of genus exactly (n-3)(n-4)/12 with all faces triangles.

Figures

Figures reproduced from arXiv: 2509.06407 by Timothy Sun.

Figure 1
Figure 1. Figure 1: A current graph with current group Z18. Since we will later need to examine the derived embeddings in detail, we give a small example in [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: A ladder defined for all s ≥ 3 and its specification for s = 5. The derived embedding is a triangular embedding of the graph K12s+11 −K5. For expository purposes, we express their additional adjacency step as generally as possible and reinterpret their two handle operations as a single modification that increases the genus by 2. Given an edge e incident with two triangular faces, removing e and replacing i… view at source ↗
Figure 3
Figure 3. Figure 3: The initial set of constraints on vortices for Case 11. [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: A sequence of edge flips that are possible on any current graph satisfying the initial [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The handle operation merges the five shaded triangles (a) into a 15-sided face (b) [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: A family of current graphs with current group [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Vortices for Case 2, where x and y are of type (V1) and (V2), respectively. equivalent to attaching a certain genus embedding of K8 along two vertex-disjoint quadran￾gular faces. After these modifications, the rotations at numbered vertices besides 0 are the same as in the original derived embedding, except possibly with 0 missing. At this point, we need to restore the edges (0, δ), (0, γ), (0, −γ), and (0… view at source ↗
Figure 8
Figure 8. Figure 8: A family of current graphs with current group [PITH_FULL_IMAGE:figures/full_fig_p008_8.png] view at source ↗
read the original abstract

In 1968, Ringel and Youngs solved the remaining cases of the orientable Map Color Theorem by finding genus embeddings of the complete graphs $K_n$, for sufficiently large $n \equiv 2, 8, 11 \pmod{12}$. Following the approach previously explored by the author for $n \equiv 8 \pmod{12}$, we aim to streamline their constructions for $n \equiv 2, 11 \pmod{12}$ by finding families of current graphs with simpler patterns for the arc labelings.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript revisits the Ringel-Youngs constructions for orientable genus embeddings of K_n when n ≡ 2 or 11 (mod 12). It proposes new infinite families of current graphs whose arc labelings follow simpler periodic patterns, with the goal of streamlining the original 1968 constructions while still producing the required 2-cell embeddings of genus ⌈(n-3)(n-4)/12⌉.

Significance. A verified simplification of the current-graph labelings for these two congruence classes would make the Ringel-Youngs proof more transparent and could facilitate generalizations or computational checks in topological graph theory. The approach is consistent with the author’s earlier work on the n ≡ 8 (mod 12) case and, if the new families satisfy the voltage and current conditions for all sufficiently large n, would constitute a modest but useful clarification of an established result.

major comments (2)
  1. The manuscript presents the new periodic labeling patterns but supplies no general argument that the currents sum to the identity at every vertex of the current graph for all large n in the stated congruence classes. This verification is load-bearing for the claim that the constructions yield valid embeddings; without it the families remain conjectural.
  2. No explicit check is given that the induced voltages produce face cycles whose degrees and Euler characteristic match the target genus for infinitely many n ≡ 2, 11 (mod 12). A single concrete example for each class together with a general pattern argument would be required.
minor comments (2)
  1. The abstract refers to “the approach previously explored by the author” but the introduction does not cite the earlier paper on the n ≡ 8 case; adding the reference would improve context.
  2. Notation for the abelian group in which currents take values is introduced only in passing; a short preliminary subsection defining the group and the Kirchhoff condition would aid readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for acknowledging the potential utility of the simplified current-graph constructions. We address each major comment below and will revise the manuscript to incorporate the requested verifications.

read point-by-point responses

  1. Referee: The manuscript presents the new periodic labeling patterns but supplies no general argument that the currents sum to the identity at every vertex of the current graph for all large n in the stated congruence classes. This verification is load-bearing for the claim that the constructions yield valid embeddings; without it the families remain conjectural.

    Authors: We agree that an explicit general argument is required to establish validity for all sufficiently large n. In the revised manuscript we will add a dedicated subsection proving that the periodic labeling (with fixed period independent of n within each congruence class) ensures that the sum of currents at every vertex is the identity in the cyclic group. The argument proceeds by partitioning the incident arcs into complete periods and verifying exact cancellation of the group elements contributed by each period. revision: yes

  2. Referee: No explicit check is given that the induced voltages produce face cycles whose degrees and Euler characteristic match the target genus for infinitely many n ≡ 2, 11 (mod 12). A single concrete example for each class together with a general pattern argument would be required.

    Authors: We will include explicit computations for representative values (n=14 for the ≡2 case and n=23 for the ≡11 case) showing the resulting face degrees and confirming the Euler characteristic equals the target genus. We will then supply a general pattern argument: because the voltage assignments follow the same periodic rule, the orders of the voltages on the faces are constant across the congruence class, and the number of faces is determined by the current-graph structure, yielding the required Euler characteristic for every n ≡ 2 or 11 (mod 12). revision: yes

Circularity Check

0 steps flagged

New current graph families for n ≡ 2,11 mod 12 presented as independent constructions

full rationale

The paper explicitly constructs families of current graphs with periodic arc labelings to produce the required genus embeddings via the Ringel-Youngs method. It references the author's prior work on the n ≡ 8 case only as a methodological precedent, not as a load-bearing premise that defines or forces the new labelings. No equations reduce a claimed prediction to a fitted parameter by construction, and the voltage/current conditions are asserted to hold directly from the given patterns rather than by self-definition or imported uniqueness theorems. The central claim therefore remains self-contained against external verification of the embeddings.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the Ringel-Youngs current-graph method being applicable once suitable labelings are found; no new free parameters, axioms, or invented entities are introduced beyond the standard framework.

axioms (1)
  • domain assumption Current graphs with appropriate arc labelings generate valid genus embeddings of complete graphs when the Ringel-Youngs conditions on voltages and currents are met.
    This is the established method being streamlined; invoked implicitly by reference to the 1968 solution.

pith-pipeline@v0.9.0 · 5606 in / 1040 out tokens · 34328 ms · 2026-05-18T18:49:50.170871+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

  1. [1]

    The genus of K_n-K_2

    Mark Jungerman. The genus of K_n-K_2 . Journal of Combinatorial Theory, Series B , 18(1):53--58, 1975

    work page 1975

  2. [2]

    Graphs on S urfaces , volume 10

    Bojan Mohar and Carsten Thomassen. Graphs on S urfaces , volume 10. Johns Hopkins University Press, 2001

    work page 2001

  3. [3]

    Map Color Theorem , volume 209

    Gerhard Ringel. Map Color Theorem , volume 209. Springer Science & Business Media, 1974

    work page 1974

  4. [4]

    Gerhard Ringel and J.W.T. Youngs. Solution of the Heawood map-coloring problem . Proceedings of the National Academy of Sciences , 60(2):438--445, 1968

    work page 1968

  5. [5]

    Gerhard Ringel and J.W.T. Youngs. Solution of the H eawood map-coloring problem --- C ase 11. Journal of Combinatorial Theory , 7(1):71--93, 1969

    work page 1969

  6. [6]

    Gerhard Ringel and J.W.T. Youngs. Solution of the H eawood map-coloring problem --- C ase 2 . Journal of Combinatorial Theory , 7(4):342--352, 1969

    work page 1969

  7. [7]

    A simple construction for orientable triangular embeddings of the complete graphs on 12s vertices

    Timothy Sun. A simple construction for orientable triangular embeddings of the complete graphs on 12s vertices. Discrete Mathematics , 342(4):1147--1151, 2019

    work page 2019

  8. [8]

    Simultaneous current graph constructions for minimum triangulations and complete graph embeddings

    Timothy Sun. Simultaneous current graph constructions for minimum triangulations and complete graph embeddings. Ars Mathematica Contemporanea , 18(2):309--337, 2020

    work page 2020

  9. [9]

    Face distributions of embeddings of complete graphs

    Timothy Sun. Face distributions of embeddings of complete graphs. Journal of Graph Theory , 97(2):281--304, 2021

    work page 2021

  10. [10]

    Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs

    Timothy Sun. Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs. European Journal of Combinatorics , 120:103974, 2024

    work page 2024