Dmitry Rybin
Dinitz-Garg-Goemans conjecture is false. This graph theory problem was open for ~30 years. The graph below has fractional flow cost 58. Any unsplittable flow (with capacity violation <=15) has cost at least 60. Chat with GPT 5.6 Pro where this was found: https://chatgpt.com/share/6a60b2eb-0b64-83ee-9c76-7931ca1de063
