flow

(2 + epsilon)-flow conjecture ★★★

Conjecture For every $\epsilon>0$ there exists an integer $k$ so that every $k$ -edge-connected graph has a $(2+\epsilon)$ -flow.

Posted by mdevos
updated February 19th, 2020