Cycle double cover
In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly twice. For instance, for any polyhedral graph, the faces of a convex polyhedron that represents the graph provide a cycle double cover of the graph: the edges of each face form a cycle and each edge belongs to exactly two faces and therefore to two of these cycles.
It is a problem posed in the 1970s by W. T. Tutte, Itai and Rodeh, George Szekeres and Paul Seymour and known as the cycle double cover conjecture, whether every bridgeless graph has a cycle double cover. The conjecture can equivalently be formulated in terms of graph embeddings, and in that context is also known as the circular embedding conjecture.
In July 2026, OpenAI released a preprint claiming a positive resolution of the conjecture, the proof of which they claim was generated by GPT-5.6, its large language model.