A 30-year graph theory conjecture was refuted after a GPT 5.6 Pro-assisted search
burny_tech · x · 2026-07-24
A 30-year-old graph theory conjecture, the Dinitz-Garg-Goemans conjecture, has been shown false.
- The post says a graph was found where fractional flow cost is 58.
- Any unsplittable flow with capacity violation ≤15 still costs at least 60.
- The discovery was made in a chat with GPT 5.6 Pro, which is presented as part of the search process.
- The attached image is just a reaction meme; the substantive content is the counterexample and the refutation of the conjecture.
Related event: GPT-5.6 Pro Reportedly Refutes 30-Year Graph Theory Conjecture(5 posts)→
More from Research
- 3D ResNet Paper Crosses 3,000 Citations Eight Years After CVPR 2018 — HirokatuKataoka · 2026-09-11
- Jeff Heaton's Intro to the Math of Neural Networks eBook Is Free to Download — blaizedsouza · 2026-09-11
- Mathematician Daniel Litt Launches Problem Repo to Track Human vs AI Progress: 15 Problems, 1 Solved — littmath · 2026-09-11
- Open ECDSA.fail challenge uses AI agents to shrink Shor's-algorithm quantum circuits for Bitcoin keys — StefanoGogioso · 2026-09-11
- Alex Townsend posts 200 open problems in numerical linear algebra for humans and AI agents — IgorCarron · 2026-09-11
- Navier-Stokes, Riemann, P vs NP: what this week's math buzzwords mean for you — koltregaskes · 2026-09-11