# flow

## (2 + epsilon)-flow conjecture ★★★

Author(s): Goddyn; Seymour

\begin{conjecture} For every $\epsilon>0$ there exists an integer $k$ so that every $k$-\Def[edge-connected]{connectivity (graph theory)} graph has a $(2+\epsilon)$-flow. \end{conjecture}

Keywords: edge-connectivity; flow