A maximum matching is a matching with the largest possible number of edges. You cannot add any more pairs without breaking the matching constraint (two edges sharing a vertex). For example, if you have people and schools, the maximum matching might pair all people (size ), or it might be smaller if some people have no valid school choices.
Finding this maximum is what Kuhn's algorithm does.