2.11 Stable Matching

Bipartite equivalence relation

When mapping girls to boys in a bipartite graph with more boys than girls, what sort of equivalence relation are we looking to find?

Exercise 1
We want every girl to be matched to a boy, making it total. There are more boys than girls, so any boy will be mapped to by at most one girl, making the mapping injective.