Max-Flow Min-Cut Theorem (From Wiki) The max-flow min-cut theorem is a statement in optimization theory about maximal flows in flow networks The maximal amount of flow is equal to the capacity of a minimal cut The maximum flow in a network is dictated by its bottleneck [1]S.-YR Li, R. W. Yeung and N Cai, Linear network Coding, IEEE TransMax-Flow Min-Cut Theorem • (From Wiki) The max-flow min-cut theorem is a statement in optimization theory about maximal flows in flow networks • The maximal amount of flow is equal to the capacity of a minimal cut. • The maximum flow in a network is dictated by its bottleneck. [1] S.-Y. R. Li, R. W. Yeung, and N. Cai, “Linear network Coding”, IEEE Trans. 5