
Kriesell, Matthias
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
.










Keywords: Disjoint paths; edge-connectivity; spanning trees
