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 Pro Claims Math Breakthroughs, But Faces Hallucination Backlash(11 posts)→
More from Fun
- User spots eerie moment: device starts running on its own with no user action — generativist · 2026-10-27
- 'We're not bad at forecasting—I'm bad at QA-ing my posts,' dlwh wraps up — dlwh · 2026-10-27
- Dev shows striking SD vs HD game texture upgrade alongside a level editor — maxleiter · 2026-10-27
- AI-generated movie-grade clip goes viral, blurring the line with real cinema — cneuralnetwork · 2026-10-27
- Drinking under the JD dog: Beijing's satellite-factory bar next to Moonshot's faux temple — teortaxesTex · 2026-10-27
- Creator's 2566-rated champion bot dethroned on Arena Ladder, training a comeback version — tristanbob · 2026-10-27