Is there a way to find no of perfect matchings in a complete graph K_{n }where n could be either even or odd..?
if n is odd then perfect matching 0. because in perfect matching degree of each vertex must be 1, which is not possible if n is odd.
and if n is even then num of perfect matching in K_{2n}=( 2n! ) / ( 2^n * n! )
explain how K2n=( 2n! ) / ( 2^n * n! )
3660 Points
2580 Points
2040 Points
1966 Points
1768 Points
1614 Points
1610 Points
1492 Points
1472 Points
1464 Points
Gatecse
Step 0: Study the topic/subject. Use Bikram ...