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.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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|cite|improve this question

Your Answer


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

Browse other questions tagged or ask your own question.