a cut is a partition of the vertices of a graph into two disjoint subsets.
The cut-set of the cut is the set of edges whose end points are in different subsets of the partition.
I would like to see if a cut-set can be defined without referring to partitioning the vertices into two groups?
I have tried this one " a cut-set is a subset of edges such that removing them will increase the connected components of the graph". But later realize that a cut-set can have no edges, if there are no edges between the two groups of vertices in the original graph.