graph-theory mathematics Cuts# Definition: Cut A cut of an undirected multigraph \(G = (V, E)\) is a partition \(C = \{S, T\}\) of \(V\) into two sets \(S\) and \(T\). Definition: Cut-Set The cut-set of \(C\) is the set of all edges connecting a vertex in \(S\) and vertex in \(T\).
