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

Sang-il Oum

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

Combinatorics 2026-07-17 v1

Authors: Sang-il Oum

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.

Keywords

cycle double cover conjecture bridgeless graph cycles OpenAI exposition

Cite

@article{arxiv.2607.16356,
  title  = {A proof of the cycle double cover conjecture by OpenAI: An exposition},
  author = {Sang-il Oum},
  journal= {arXiv preprint arXiv:2607.16356},
  year   = {2026}
}

Comments

9 pages; Comments are welcome