Dmitry Rybin on X: "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://t.co/Oi2PQoab2h https://t.co/3ihncPMpve" / X<br>Post
Log inSign up
Post
Dmitry Rybin<br>@DmitryRybin1
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 chatgpt.com/share/6a60b2eb…
span:not(:empty)~span:not(:empty)]:before:content-['·'] [&>span:not(:empty)~span:not(:empty)]:before:px-1 [&>span:not(:empty)~span:not(:empty)]:before:shrink-0">12:18 PM · Jul 22, 2026744.4KViews
1040104<br>3050305<br>4.1K04.1K<br>1.4K01.4K
Read 104 replies
New to X?<br>Sign up now to get your own personalized timeline!<br>Sign up with GoogleSign up with AppleCreate account<br>By signing up, you agree to the Terms of Service and Privacy Policy, including Cookie Use.
Relevant people<br>Dmitry Rybin@DmitryRybin1Follow
Don't miss what's happening<br>People on X are the first to know.
Log inSign up
Trending now