A 30-year graph theory conjecture is claimed false with a GPT-5.6 Pro-found counterexample
cloneofsimo · x · 2026-07-22
A quoted post claims the Dinitz-Garg-Goemans conjecture, open for roughly 30 years, is false.
The result is presented with a concrete graph example: the graph has fractional flow cost 58, while any unsplittable flow with capacity violation at most 15 must cost at least 60. The author says the counterexample was found in a chat with GPT-5.6 Pro, underscoring the growing role of LLMs in mathematical exploration.
The main news here is not the tweet itself, but that a decades-old graph theory conjecture is being claimed false with a specific counterexample.
Related event: GPT-5.6 Pro Claims Math Breakthroughs, But Faces Hallucination Backlash(11 posts)→
More from Research
- Open ECDSA.fail challenge uses AI agents to shrink Shor's-algorithm quantum circuits for Bitcoin keys — StefanoGogioso · 2026-09-11
- Alex Townsend posts 200 open problems in numerical linear algebra for humans and AI agents — IgorCarron · 2026-09-11
- Navier-Stokes, Riemann, P vs NP: what this week's math buzzwords mean for you — koltregaskes · 2026-09-11
- Fruit fly brain as an LLM: connectome-driven language model demo goes live — ngxson · 2026-09-11
- Harry Collins: LLMs can't do frontier science because they can't invent new language — whoamisri · 2026-09-11
- The Waymo effect: how AI is quietly making research less collaborative — JohnHammersley · 2026-09-11