Edge-Disjoint Cycles: OpenAI’s O(n) Proof Untangles a 60-Year Graph Theory Conjecture
How many pieces do you need to take a graph apart? A complete graph can have more than half a billion edges on 32,000 vertices, yet OpenAI’s proof shows that a constant times the vertex count always suffices. The pieces are edge disjoint cycles and single edges. The result settles the Erdős–Gallai cycle decomposition conjecture, … Read more