Proof of Theorem 1, p. 402 — the value of every flow is at most v(D) for every disconnecting set D

Initializing...

Proof of Theorem 1, p. 402 — the value of every flow is at most v(D) for every disconnecting set D · Prove2Me