A proof of the cycle double cover conjecture by OpenAI: An exposition

2026/07/17 by Sang-il Oum · 1 voice
#math.CO

paper · pdf

Abstract

The cycle double cover conjecture states that every bridgeless graph has a list of cycles such that every edge is in exactly two of them. In July 2026, OpenAI announced a proof. This exposition presents the proof with slight modifications intended to make it more accessible.

Discussions

• #New_arXiv_paper *Sang-il Oum*, A proof of the cycle double cover conjecture by OpenAI: An exposition, 2026. arxiv.org/abs/2607.16356 [bsky, 1 points, 0 comments]

Related

• Cycle Double Cover Conjecture
• A Constructive Proof of the Cycle Double Cover Conjecture
• A Simple Proof for the Cycle Double Cover Conjecture
• OpenAI's proof of the Cycle Double Cover Theorem
• A proof of the Cycle Double Cover Conjecture