- Series
- Graph Theory Seminar
- Time
- Tuesday, September 8, 2026 - 3:45pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Richter Jordaan – Georgia Tech
- Organizer
- Rose McCarty and Caleb McFarland
In July 2026, OpenAI announced a fully automated proof of the Cycle Double Cover Conjecture, solving a 50-year old problem of fundamental importance in graph theory. There are now several different non-AI expositions of this short proof. We present the proof in this seminar talk. If there is time, we may also have a short group discussion, moderated by Rose McCarty, about how AI is changing the way we approach mathematics.