0 votes 0 votes The bipartite graph G = (V ,E) with bipartition (V1, V2) has a complete matching from V1 to V2 if and only if |N(A)| ≥ |A| for all subsets A of V1. Mathematical Logic graph-theory + – hem chandra joshi asked Oct 25, 2017 hem chandra joshi 237 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.