برش بیشینه

Also known as Max-Cut problem

a cut of a graph whose size is at least the size of any other cut