Home » Author index

Seymour, Paul D.


Graph Theory » Coloring » Nowhere-zero flows

(2 + epsilon)-flow conjecture ★★★

Author(s): Goddyn; Seymour

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

Keywords: edge-connectivity; flow

Posted by mdevos
updated March 7th, 2007
add new comment
Syndicate content