The maximum flow in a network will always be less than or equal to the minimum of the minimum of the total capacity of the branches leaving the source or entering the sink.

Question

Quizplus · Accepted Answer

This statement is essentially a restatement of the max-flow min-cut theorem, which asserts that the maximum flow from a source to a sink in a network is equal to the minimum capacity that, when removed, would disconnect the source from the sink. The total capacity of the branches leaving the source or entering the sink sets an upper limit on the flow through the network.

The Maximum Flow in a Network Will Always Be Less