GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
299 views

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

asked in Graph Theory by Active (1.4k points)   | 299 views

2 Answers

+4 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 K2n=( 2n! ) / ( 2^n  *  n! )

answered by Boss (7.4k points)  
selected by

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

+1 vote
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).
answered by Veteran (40.7k points)  

Related questions

+1 vote
1 answer
1
asked in Graph Theory by shikharV Boss (5.1k points)   | 148 views
+3 votes
2 answers
2
Top Users Jan 2017
  1. Debashish Deka

    8126 Points

  2. sudsho

    5042 Points

  3. Habibkhan

    4706 Points

  4. Vijay Thakur

    4458 Points

  5. Bikram

    4348 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4010 Points

  8. santhoshdevulapally

    3722 Points

  9. GateSet

    3292 Points

  10. Sushant Gokhale

    3286 Points

Monthly Topper: Rs. 500 gift card

19,122 questions
24,034 answers
52,724 comments
20,276 users