Preprint
Aug 2026
Disproving the Petersen Coloring Conjecture: Theoretical Analysis and an Infinite Family of Counterexamples
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 to Jaeger's conjecture would have immediately resolved several other famous and long-s...
J. Goedgebeur, Jorik Jooken, Edita Máčajová et al.
· 0 citations