1,045 views
0 votes
0 votes
Perfect matching is a set of edges such that each vertex appears only once and all vertices appear at least once (EXACTLY one appearance). So for n vertices perfect matching will have n/2 edges and there won't be any perfect matching if n is odd.
 

I don't know whether i got it properly or not. Can please anybody explain the Perfect matching in a complete graph with simpler examples ?

1 Answer

2 votes
2 votes

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching.

 an independent set or stable set is a set of vertices in a graph, no two of which are adjacent.

maximum independent set is an independent set of largest possible size for a given graph G. This size is called the independence number of G, and denoted α(G)

----------------------------------------------------------------------------------------------------------------

Perfect matching exists for only graph with even number of vertices. No graph with odd number of vertices can contain perfect matching

here u get matching for complete graph

http://mathworld.wolfram.com/PerfectMatching.html

https://en.wikipedia.org/wiki/Independent_set_(graph_theory)

Related questions

0 votes
0 votes
0 answers
1
Jaspreet Kaur Bains asked Dec 19, 2017
1,720 views
Consider complete graphs K5 and K6 . Let X5 and X6 are number of perfect matching of K5 and K6 respectively. Then X5 + X6 = ________.
1 votes
1 votes
2 answers
2
16 votes
16 votes
3 answers
3
dhingrak asked Dec 2, 2014
10,756 views
Is there a way to find no of perfect matchings in a complete graph Kn where n could be either even or odd..?