Maximum bipartite matching

graphs Maximum flow

The maximum bipartite matching problem is a graph problem where we find a subset $M\subseteq E$ of the graph such that $\forall v\in V$, it is matched if at most one edge from $M$ Is incident.