If s and t are two nodes in a graph. How to prove that the maximum number of edge-disjoint cut sets which divide s and t equals the length of the shortest path from s to t?
Number of cut sets and the length of the shortest path?
2
$\begingroup$
graph-theory
-
0What have you done to get started? – 2012-12-18