Matching, Hall's marriage theorem, Proof of Hall's marriage theorem, necessary condition of Hall's marriage theorem, sufficiency condition of Hall's marriage theorem
doesn't look like example diagram @7:47 makes a complete matching, because one vertex in V_2 is missing in matching graph. According to definition of complete/perfect matching, edge induced sub-graph must cover all vertices.
doesn't look like example diagram @7:47 makes a complete matching, because one vertex in V_2 is missing in matching graph. According to definition of complete/perfect matching, edge induced sub-graph must cover all vertices.
nice explanation