In a flow network, a cut refers to dividing the network into two disjoint subsets, where all flow goes from one subset to the other. The capacity of a cut is the sum of the capacities of the edges that cross the cut, serving as an upper bound on the maximum possible flow from the source to the sink in the network.