GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
479 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)   | 479 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)  

Related questions



Top Users Mar 2017
  1. rude

    4272 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2244 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1338 Points

  8. Akriti sood

    1246 Points

  9. Bikram

    1246 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,452 questions
26,771 answers
60,972 comments
22,985 users