Max-Flow Min-Cut Theorem

The Max-Flow Min-Cut Theorem states that in a network, the maximum amount of flow that can be sent from a source to a sink equals the smallest total capacity of the edges that, if cut, would separate the source from the sink. Essentially, it links the limited capacity of the network's bottleneck edges (the min cut) with the highest possible flow achievable between two points. This principle helps in optimizing network throughput and understanding the constraints within systems like transportation, communication, or supply chains.