Dmitry Rybin @DmitryRybin1 · 22 Jul 2026
The conjecture was based on absolutely stunning result of Dinitz, Garg, and Goemans: any fractional flow can be routed to unsplittable flow by violating graph capacities by at most max(demand). The chat with gpt pro here is an absolute meme
149 790Views
1 149Likes
10Reposts
4Replies
0Quotes
53Bookmarks
Is that a lot?
0.92×vs this author's median162 568 views is typical
25Percentile for this authorof 4 recent posts
51.7×vs under 10K median2 899 views is typical
23.5× audienceReachviews ÷ followers
0.78%Engagement rateof viewers reacted