KnowraMax-flow min-cut theoremLinked fromLinked fromThe 6 pages that link to Max-flow min-cut theorem, each with the reason it gives.All 6Related 5Narrower topic 1Augmenting pathRelated: When no augmenting path remains, this theorem certifies that the flow is maximum.Maximum flow problemRelated: It certifies optimality by connecting the flow value to a separating bottleneck.Hall's marriage theoremRelated: Network flows offer an algorithmic route to matching problems beyond the theorem's existence criterion.Ford–Fulkerson algorithmNarrower topic: It certifies that no larger flow exists once no residual source-to-sink path remains.Menger's theoremRelated: It is the broader optimization theorem often used to prove Menger's result.Edmonds–Karp algorithmRelated: It certifies optimality when no residual source-to-sink path remains.