Proved
Infinite family consequence reported ↗
Uses the separate Ma–Mattiolo–Steffen–Wolf theorem.
Source dated Aug 8, 2026 · Observed Oct 14, 2026
Theorem · version 1
Infinitely many connected simple bridgeless cubic graphs admit no Petersen coloring.
Proved
Uses the separate Ma–Mattiolo–Steffen–Wolf theorem.
Source dated Aug 8, 2026 · Observed Oct 14, 2026
In this problem · publication v3 · Selected context
Related result · Proved
Relationship not independently reviewed. This concerns its use in this problem.
In this problem · publication v7
Related result · Proved
Relationship not independently reviewed. This concerns its use in this problem.
The finite counterexample together with the cited universal-target theorem implies infinitely many connected simple bridgeless cubic counterexamples.
paraphrase · Linked proof prose is not republished. Any copied graph data is CC0, as specified by its archive.
Bryce Putman · Preprint · Publication date Aug 8, 2026
Source-reported results and external checks are separate from independent OpenMath assessment.
Source revision: v1. Observed Oct 14, 2026.
Putman reports extensive OpenAI-model assistance in discovery, search, verification and preparation; he reviewed the final claims and artifacts and accepts responsibility.
Statement versions and problem publication versions are separate. A new publication can update context or sources while retaining the same statement.
Assessments retained in these publication records. Earlier statement versions retain their own source histories.
Proved
Uses the separate Ma–Mattiolo–Steffen–Wolf theorem.
Source dated Aug 8, 2026 · Observed Oct 14, 2026 · Source passage →