Take the 2-minute tour ×
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.

Based on the cactus representation of minimum cuts, it would seem that for a graph with $n$ vertices and edge-connectivity $c$, where $c$ is odd, that the maximum number of min-cuts is something like $n$ or $n-1$. (This is clearly true for $c = 1$).

I just want to confirm that this is correct? Is there are any reference that lays this out clearly?

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.