Systems of Distinct Representatives — David Guichard
Mathematics — Combinatorics · matchings
Problem
In this bipartite graph, find a maximum matching and a minimum vertex cover using the algorithm of this section. Start with the matching shown in red.
w1v1w2v2w3v3w4v4w5v5w6v6w7v7v8
(See figure in text for the specific edge set.)