A 30-year graph theory conjecture falls to a GPT-5.6-assisted counterexample
code_star · x · 2026-07-23
A 30-year-old graph theory conjecture, the Dinitz-Garg-Goemans conjecture, has been shown false.
The cited counterexample has a fractional flow cost of 58, while any unsplittable flow with capacity violation ≤15 must cost at least 60. The poster also notes that the counterexample was found in a chat with GPT-5.6 Pro, which adds a fun AI-assisted angle to the result.
Related event: GPT-5.6 and Other Models Claim Major Math Breakthroughs(8 posts)→
More from Fun
- A joke imagines Claude and Grok landing in Baldur’s Gate 3 next — omnivaughn · 2026-07-23
- Tesla posts a new FSD safety demo showing accident avoidance — chrisfleck · 2026-07-23
- Meme post jokes that GPT-5.6 Pro “disproved” a 30-year math conjecture — zacharynado · 2026-07-23
- Reddit user says OpenAI limits, promo drama, and sandbox failures pushed them away — Jolly-Ad-7153 · 2026-07-23
- Figure appears ahead of Optimus on autonomy, but demand for humanoid labor still looks huge — markjeffrey · 2026-07-23
- ChatGPT Image 2.0 turns out a moody, classical-style painting — DeryaTR_ · 2026-07-23