Acomplete matching from V to W is a set of edges such that every vertex in V is connected to a unique vertex in W.

The set of edges is thus vertex-disjoint