OpenAI's proof of the Cycle Double Cover Theorem

2026/07/16 by Jim Geelen · 1 voice
#math.CO

paper · pdf

Abstract

The following notes are my attempt to clarify, to myself, the OpenAI proof of the Cycle Double Cover Conjecture. This write-up offers no new insights, but some people may find it easier to read.

Discussions

• Not a counterexaple: The AI proved it. The proof is surprisingly short and uses standard techniques and combines them in a clever way. Jim Geelen has a nice write-up here arxiv.org/abs/2607.15399 . [bsky, 3 points, 1 comments]

Related

• A proof of the cycle double cover conjecture by OpenAI: An exposition
• Weak embedding theorem and a proof of cycle double cover of bridgeless graphs
• A Constructive Proof of the Cycle Double Cover Conjecture
• Cycle Double Cover Conjecture
• On The Cycle Double Cover Problem