GPT session reportedly found a counterexample to a 30-year graph theory conjecture
ersatzben · x · 2026-07-23
A GPT session reportedly spent about 53 minutes proposing a structured counterexample to the general non-planar case of the Dinitz-Garg-Goemans conjecture, which had been open for roughly 30 years.
- The screenshot shows a prompt asking the model to “do a breakthrough” and construct a counterexample.
- The cited result claims the conjecture is false in the general non-planar case.
- The poster says the model helped find a structured counterexample, with the work taking 52m 52s.
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