Sang-il Oum (엄상일), A proof of the cycle double cover conjecture by OpenAI
July 16 Thursday @ 4:30 PM - 5:30 PM KST
Room B332,
IBS (기초과학연구원)
The cycle double cover conjecture (CDC) claims that every graph without cut-edges has a list of cycles such that every edge appears exactly twice in the list. This conjecture was proposed in 1970s by several mathematicians independently, including Tutte, Seymour, and Szekeres.
On July 10, 2026, OpenAI released a proof found by its ChatGPT 5.6 Sol Ultra. I will explain a slightly modified proof, with the aim of making it mostly accessible to undergraduate students.
