# Max-flow min-cut theorem

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Max-flow min-cut theorem](https://ocme.evemisslab.com/en/atlas/atlas-max-flow-min-cut-theorem/)

In a finite capacitated network the largest feasible flow value equals the least capacity among all source–sink cuts.

atlas-max-flow-min-cut-theorem · canonical_mko

[Max-flow min-cut theorem](https://ocme.evemisslab.com/en/mko/mko-max-flow-min-cut-theorem/)

## Prerequisite nodes


- [Finite flow network](https://ocme.evemisslab.com/en/atlas/atlas-finite-flow-network/)
- [Optimization problem](https://ocme.evemisslab.com/en/atlas/atlas-optimization-problem/)
- [Linear programming](https://ocme.evemisslab.com/en/atlas/atlas-linear-programming/)