Flow feasibility and max-flow/min-cut certificate
A directed network flow respects nonnegative capacities and conserves flow at vertices other than source s and sink t.
Key knowledge
A directed network flow respects nonnegative capacities and conserves flow at vertices other than source s and sink t. Residual capacities allow unused forward flow and undoing existing flow. A feasible flow is maximum exactly when no residual s–t path exists, equivalently when its value equals the capacity of some s–t cut.
Conditions and scope
- Use a finite network, distinct s,t and finite capacities.
- The cut capacity sums original edges from its source side to sink side; a feasible flow alone is not an optimality certificate.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture 13 network/residual definitions and Theorem 13.7, printed pages 1–2 and 6–7.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-max-flow-min-cut
- Revision
- university-core.1
- Structured reference record
- University core expansion