#max-cut

A cut is a partition of vertices of a graph into two subsets disjoint subsets. Minimum cut is a cut with a largest possible cut-set.

https://en.wikipedia.org/wiki/Maximum_cut