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
- Open ECDSA.fail challenge uses AI agents to shrink Shor's-algorithm quantum circuits for Bitcoin keys — StefanoGogioso · 2026-09-11
- Someone built a website where you can sign up for AI not to kill you — motionbynick · 2026-09-11
- Fruit fly brain as an LLM: connectome-driven language model demo goes live — ngxson · 2026-09-11
- Meme: Engineers Unleash 10,000 Claude Sub-Agents on Friday Afternoon to Clear a Week's Work — _jaydeepkarale · 2026-09-11
- AI safety isn't a coordinated cabal: half the field has posted their life stories on LessWrong — ShakeelHashim · 2026-09-11
- Kid Coins "Princessmaxxing" After Subway Chat About Same-Sex Wedding Attire — anderssandberg · 2026-09-11