Unit V
Matching
distinct representative problem
definition of matching maximal matching matching number complete matching
a complete matching in a bipartite graph exist if and only if r vertices in V1 is adjacent to r vertices in V2.
example to theorem
Page : 87,88,89
