Maximum cut: Difference between revisions

 

For a [[Graph (discrete mathematics)|graph]], a '''maximum cut''' is a [[cut (graph theory)|cut]] whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the '''Max-Cut Problem.'''