1. The problem statement, all variables and given/known data Let G=A U B be a bipartite graph. For each a in A and for each b in B we have d(a)≥d(b)≥1 where d(v) is the degree of vertex v. Show that there exists a matching which saturates A. 2. Relevant equations 3. The attempt at a solution I guess I need to use Hall's Theorem, but I don't see how.