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
- 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