- a matching in a Bipartite Graph is a set of the edges chosen in such a way that no two edges share an endpoint.
- a maximum matching is a matching of maximum size (maximum number of edges)
Solving Maximum Bipartite Matching Problem With Maximum Flow
maximum bipartite matching problem
problem transformed into a maximum flow problem
THEOREM: there are k matchings if and only if the max flow value is k