1.I.8C

Optimization
Part IB, 2007

State and prove the max-flow min-cut theorem for network flows.