A cut is minimum if the size or weight of the cut is not larger than the size of any other cut.
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.