If all edges in a network have distinct capacities, then the min-cut is unique

1.9k Views Asked by At

I'm stuck trying to prove that If all edges in a network have distinct capacities, then the min-cut is unique. I'd like to know if there is some proof that doesn't involve going through F&F algorithm, or designing one. Instead, I tried proving it by contradiction, assuming the existence of two different cuts with equal capacities (and both minimums) but I don't know how to arrive to a contradiction.

1

There are 1 best solutions below

0
On BEST ANSWER

There is the following counterexample for the claim you trying to prove.

enter image description here