Bryce Putman

A 112-Vertex Counterexample to the Petersen Coloring Conjecture

This record reports an explicit simple connected bridgeless cubic graph on 112 vertices and 168 edges with no Petersen coloring, and equivalently no normal 5-edge-coloring. The main graph is identified by the normalized sorted-edge-list SHA-256 digest dc16cc18600cf77c8661b7baf89c...

A 112-Vertex Counterexample to the Petersen Coloring Conjecture

This record reports an explicit simple connected bridgeless cubic graph on 112 vertices and 168 edges with no Petersen coloring, and equivalently no normal 5-edge-coloring. The main graph is identified by the normalized sorted-edge-list SHA-256 digest dc16cc18600cf77c8661b7baf89c...