# edge-connectivity

## Kriesell's Conjecture ★★

Author(s): Kriesell

Conjecture   Let be a graph and let such that for any pair there are edge-disjoint paths from to in . Then contains edge-disjoint trees, each of which contains .

## Partitioning edge-connectivity ★★

Author(s): DeVos

Question   Let be an -edge-connected graph. Does there exist a partition of so that is -edge-connected and is -edge-connected?

Keywords: edge-coloring; edge-connectivity

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

Author(s): Goddyn; Seymour

Conjecture   For every there exists an integer so that every -edge-connected graph has a -flow.

Keywords: edge-connectivity; flow