Break left and right vertices into top and bottom subsets.
The size of a cut is the number of bottom left nodes x, plus the number of top right nodes y, plus the number of edges from top left to lower right z.
Lemma: The size x+y+z of any cut is an upper bound on the size of the maximum matching.
Why? Picture.
