arya 🏴 @aryabhuptani · 22 Jul 2026
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
4 852 253Views
10 018Likes
931Reposts
263Replies
643Quotes
0Bookmarks
Is that a lot?
990×vs this author's median4 902 views is typical
88Percentile for this authorof 8 recent posts
1 882×vs 10K–100K median2 578 views is typical
279.0× audienceReachviews ÷ followers
0.24%Engagement rateof viewers reacted