We'll also be covering this supposed counterexample to the Dinitz-Garg-Goemans conjecture that was posted yesterday (you should check out the prompts that were used to find the counter example - they are hilarious) x.com/dmitryrybin1/s... 3/4
Dmitry Rybin (@DmitryRybin1) on XDinitz-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 x.com