Dinitz-Garg-Goemans conjecture is false

Algorithms & Data Structures(twitter.com)view on HackerNews

graph theoryDinitz-Garg-Goemans conjectureunsplittable flow

Author: bifftastic

Date: 7/22/2026

Article Summary:

Dmitry Rybin announces that the Dinitz-Garg-Goemans conjecture is false, a graph theory problem that was open for 30 years.