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?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
First show that the size of any collection of edge-disjoint cut-sets cannot exceed the length of the shortest path.
Perhaps this paper might be of use: