= Let G = (V, E) be any flow network with edge capacities c(e), let U be any minimum capacity s-t cut in G, and let (u, v) E E be any edge such that u E U,v & U. Prove that in any maximum flow f on G, f(u, v) = c(u, v) (that is, the edge (u, v) is fully saturated with flow)