Metraipolis › archive › dc_0697bf7e276c
Disproving the Petersen Coloring Conjecture: Theoretical Analysis and an Infinite Family of Counterexamples — arXiv:2608.10028
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.10028
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:27:21.701Z
- SHA-256 of the archived text
ae5570c0a27f92d8bd4a2d62cc1a21d991b4443071db4d9e57b443086a22c5b3- Stable URL of this page
https://metraipolis.com/documento/dc_0697bf7e276c
How to cite
Disproving the Petersen Coloring Conjecture: Theoretical Analysis and an Infinite Family of Counterexamples — arXiv:2608.10028 — arXiv (en), https://arxiv.org/abs/2608.10028 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0697bf7e276c (Metraipolis archive dc_0697bf7e276c, sha256 ae5570c0a27f92d8bd4a2d62cc1a21d991b4443071db4d9e57b443086a22c5b3)
BibTeX
@misc{dc0697bf7e276c,
title = {Disproving the Petersen Coloring Conjecture: Theoretical Analysis and an Infinite Family of Counterexamples — arXiv:2608.10028},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.10028},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0697bf7e276c; sha256 ae5570c0a27f92d8bd4a2d62cc1a21d991b4443071db4d9e57b443086a22c5b3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10028. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In 1988, Jaeger conjectured that every bridgeless cubic graph $G$ admits a Petersen coloring; that is, a map $E(G) \to E(P)$ mapping any two adjacent edges of $G$ to two adjacent edges of the Petersen graph $P$. A positive resolution of Jaeger's conjecture would have immediately resolved several other famous and long-standing problems in graph theory. In July 2026, a 68-vertex counterexample was announced on X. Shortly afterwards, Putman independently presented two non-isomorphic 112-vertex counterexamples, relying solely on computer-assisted verification. In this paper, we present two counterexamples of order $52$, currently the smallest known, and provide a purely theoretical proof. In the second part, we construct an infinite family of cyclically $4$-edge-connected cubic graphs without a Petersen coloring for every even order at least $60$. Additionally, through computational verification, we show that any counterexample must have order at least $40$. Moreover, we show that our counterexamples provide a negative answer to other related problems. Finally, we conclude the paper by discussing key open problems and highlighting avenues for future work. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.10028 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T06:20:30.680Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).