=> CelebratedMax-flow Min-Cut Theorem
The value of a maximum flow in a network is equal to the minimum capacity of a cut.
The Integral Flow Theorem
If the capacities of all edges in the network are integers, then there is a maximum flow whose value is an integer.