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
- PSNR below 15 dB in papers likely means the metric was misused, researcher warns — kwangmoo_yi · 2026-10-27
- Ortet's first health eval: 34 open-weight models, 50 tasks, generic rankings fall short — thegautamkamath · 2026-10-27
- Scaling-fit discrepancy: output-head FLOPs are ~65% of compute at the smallest rung, ~3% at 535B — dlwh · 2026-10-27
- Marin's dlwh Explains the Scaling Law Fit: Estimating the Loss Floor Early — dlwh · 2026-10-27
- Marin's Open Scaling Law Extrapolates 300× and Predicts Loss Within 0.2% — dlwh · 2026-10-27
- Marin Shares Forecast-vs-Measured Plots: Paloma Hits 0.4% RMS Error — dlwh · 2026-10-27