Guichard-Combinatorics-Graph-Theory · Problem 4.5.1
Systems of Distinct Representatives
Mathematics — Probability · matchings
Problem
In the bipartite graph below, find a maximum matching and a minimum vertex cover using the algorithm of this section. Start with the matching shown in red.
w1∙w2∙w3∙w4∙w5∙w6∙w7∙v1∙v2∙v3∙v4∙v5∙v6∙v7∙v8∙