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.
More from Research
- Hugging Face reportedly used GLM 5.2 after commercial models blocked incident-response work — ctjlewis · 2026-07-22
- Robotics paper says dense patch features beat bigger vision-language models — stepjamUK · 2026-07-22
- Meta’s GAMUT benchmark says top models still miss half the needed facts — dair_ai · 2026-07-22
- New paper links intelligence to a learnable-novelty view of Epiplexity — theomitsa · 2026-07-22
- Turing Motors says its CTO won gold in Kaggle’s 2026 ARC-AGI-linked contest — MeganRisdal · 2026-07-22
- Paper warns dubious Kaggle medical datasets are reaching both papers and clinics — EhudReiter · 2026-07-22