Matching in a graph is Distinct set of edges.
matching M in G is a set of pairwise non-adjacent edges; that is, no two edges share a common vertex
Types of Maching
1.Maximum:-Contain maximum no. of edges
2.Maximal:-A set when no. more edges can be added
3.Complete matching from set v1 to set v2 such that every vertex in v1 gets matched
4.Perfect Matching :-
1.when every vertex gets matched
2.perfect matching is only possible with even number of vertices
3.No. of perfect matchings for odd number of vertices are 0.
4.No. of matching in complete graph with even number of vertices are
here, n=2m=number of vertices.