maximum cut

English

Noun

maximum cut (plural maximum cuts)

1. (graph theory) A cut whose size is at least the size of any other cut; a partition of the graph's vertices into two complementary sets S and T, such that the number of edges between S and T is as large as possible.

   Antonym: minimum cut