prove that a graph G=(V,E) where | v | =n there are at most n-1 edge disjoint cut sets.
I was thinking that for tree it is true since each edge is cut set. but i have no idea how to prove above statement.
Hint:
Let $e \in E$ be arbitrary edge, consider two cases:
What is left after we have removed all the edges we could?
I hope this helps $\ddot\smile$