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! )
5224 Points
4230 Points
3748 Points
2986 Points
2356 Points
2298 Points
2142 Points
2008 Points
1654 Points
1628 Points
Gatecse
"If you leave the M. Tech course ...