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! )
3152 Points
1616 Points
1580 Points
1336 Points
1230 Points
1028 Points
1012 Points
972 Points
810 Points
662 Points
242 Points
138 Points
112 Points
104 Points
64 Points
Gatecse