in Graph Theory
8,197 views
15 votes
15 votes

Is there a way to find no of perfect matchings in a complete graph Kwhere n could be either even or odd..?

in Graph Theory
8.2k views

2 Answers

16 votes
16 votes
Best answer
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}=\dfrac{(2n!)}{( 2^n  *  n! )}$
edited by

2 Comments

explain how  K2n=( 2n! ) / ( 2^n  *  n! )

2
2
\begin{align} \#\text{Perfect matchings of $K_{2n}$} &= (2n-1)(2n-3)(2n-5)\cdots 5.3.1\\ &=\dfrac{(2n)(2n-1)(2n-2)(2n-3)\cdots 5.4.3.2.1}{(2n)(2n-2)\cdots4.2}\\ &=\dfrac{(2n)!}{(2*n)(2*(n-1))\cdots(2*2)(2*1)}\\ &= \bbox[yellow,5px,border: 2px solid red]{\dfrac{(2n)!}{2^n\times n!}} \end{align}
7
7
14 votes
14 votes
For Kn

if n is odd , then there is no perfect matching.

n is even then you can count it like ->

(n-1) (n-3) (n-5)...1 (This will end in 1 as n is even).

Related questions

1 vote
1 vote
2 answers
1