in a bipartite graph can be treated as a network flow problem. Finding a largest matching in a general graph is much more difficult; it can be done using Edmonds' blossom algorithm.

Definitions

Given a graph a matching M in G is a set of pairwise non-adjacent edges,