A 30-year graph theory conjecture was refuted after a GPT 5.6 Pro-assisted search
burny_tech · x · 2026-07-24
A 30-year-old graph theory conjecture, the Dinitz-Garg-Goemans conjecture, has been shown false.
- The post says a graph was found where fractional flow cost is 58.
- Any unsplittable flow with capacity violation ≤15 still costs at least 60.
- The discovery was made in a chat with GPT 5.6 Pro, which is presented as part of the search process.
- The attached image is just a reaction meme; the substantive content is the counterexample and the refutation of the conjecture.
Related event: GPT-5.6 Pro Helps Disprove 30-Year-Old Graph Theory Conjecture(3 posts)→
More from Research
- HyperNet injects facts into frozen LLMs by generating LoRA weights — rohanpaul_ai · 2026-07-24
- Study: Replay of Procedural Memory Occurs Independently of the Hippocampus — ClementineDomi6 · 2026-07-24
- Independent search lifts Fable, Sol, Grok, and Gemini accuracy in real-world tasks — ycombinator · 2026-07-24
- AI is making null-result papers cheaper, and that could further pollute science — soumitrashukla9 · 2026-07-24
- GLM-5.2’s blog hints Z.ai dropped GRPO and went back to PPO — bycloud · 2026-07-24
- VideoTreeSearch: Organizing Videos as Trees for Grounded Long Video QA — mohitban47 · 2026-07-24