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! )
3704 Points
1484 Points
1432 Points
1408 Points
1311 Points
1194 Points
1132 Points
994 Points
932 Points
930 Points
1960 Points
1306 Points
502 Points
410 Points
388 Points
Gatecse
@Arjun Sir the problem is not with the ...