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! )
4902 Points
4704 Points
3480 Points
3158 Points
3012 Points
2480 Points
2388 Points
2138 Points
2060 Points
1758 Points
Gatecse