Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

max-flow min-cut theorem

The most flow that can possibly get from source to sink always equals the capacity of the tightest bottleneck separating them.

The max-flow min-cut theorem: in any flow network, the maximum value of an s–t flow equals the minimum capacity of an s–t cut (theorem: max-flow-min-cut-theorem).

See also

flow network Menger's theorem
Read the full section →
Graph settings

Calculator