A proof of the cycle double cover conjecture by OpenAI: An exposition
arXiv:2607.16356
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.
10 pages; Adding subsections on small cycle double cover conjecture (suggested by Adrian Bondy) and implications to matroids, due to Jamshy and Tarsi