Theorem 5.26: Let G(Vi, v2) be a bipartite graph with Vil=V2. Then a complete matching of G from Vi to v2 is a perfect matching▪ Theorem 5.26: Let G(V1 ,V2 ) be a bipartite graph with |V1 |=|V2 |. Then a complete matching of G from V1 to V2 is a perfect matching