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

The Gateway to Computer Science Excellence

+12 votes

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

+15 votes

Best answer

52,345 questions

60,481 answers

201,810 comments

95,282 users