betaFeedback

WorksMathematics

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

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.

Paper details

vlnc:W_n5qs7udw
Version
v2 · latest
Published
Added
License
arXiv nonexclusive license
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…