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 Reportedly Refutes 30-Year Graph Theory Conjecture(5 posts)→
More from Research
- New paper: LLM data schedules and learning rate schedules should be co-designed — jasondeanlee · 2026-10-27
- What makes research get adopted: important problems, proper evals, and usability — srchvrs · 2026-10-27
- Bitter lesson part 2: few academic inventions matter, and conference publications aren't the key — srchvrs · 2026-10-27
- First-week PhD student lands ARR Area Chair role, exposing peer-review quirks — anmarasovic · 2026-10-27
- EMNLP keynote: industry does read academic NLP papers, it just rarely credits them — srchvrs · 2026-10-27
- UK AISI: under $80 of fine-tuning fully restores filtered bio capabilities in open-weight models — connoraxiotes · 2026-10-27