GPT 5.6 Pro Disproves Dinitz-Garg-Goemans Conjecture
July 22, 2026
A user report claims GPT 5.6 Pro identified a counterexample to the Dinitz-Garg-Goemans conjecture, a graph theory problem open for 30 years. The model identified a graph where fractional flow cost is 58, while any unsplittable flow with capacity violation <=15 has a cost of at least 60.
HOW THIS AFFECTS YOU
●
researcherYou should evaluate whether frontier models can reliably assist in formal mathematical proofs and counterexample generation.