Assertion: minimum cut | /r/CapableOf | separate the source
Facets:
Source sentences:
text: The max-flow min-cut theorem proves that the maximum network flow and the sum of the cut-edge weights of any minimum cut that separates the source and the sink are equal.