GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
538 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)   | 538 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.6k 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 (41.3k points)  


Top Users Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2580 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Prashant.

    1492 Points

  9. Arjun

    1472 Points

  10. Arunav Khare

    1464 Points

Monthly Topper: Rs. 500 gift card

22,086 questions
28,062 answers
63,297 comments
24,169 users