Question: (a) Suppose VI and V2 are the bipartition sets in a bipartite graph G. If |V1| > |V2|, then it is clearly impossible to find a matching which saturates V1. State a result which is applicable to this case and give a necessary and sufficient condition for your result to hold.
(b) How should your result in (a) be interpreted when applied to the job assignment problem?