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

Suppose a graph $G$ has edge-connectivity $c$. The min-cuts of $G$ (the cuts of weight $c$) can be represented in terms of a cactus graph $H$. This is "well-known".

Each vertex of $w \in H$ corresponds to a subset of vertices $v_1, \dots, v_k \in G$. Do the vertices $v_1, \dots, v_k$ need to be connected in $G$? Must they be highly-connected, such as $c/2$-connected or something like this? Any pointers to a good reference about the cactus graph and its properties would be very helpful too.

Thanks for the help!

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.