Perfect Matching in Graph Theory Hindi | Properties of Perfect Matching | Discrete Mathematics GATE

[@ujjwalbansal1070]

The concept explanation is quite simple and clear. But there is one simple problem if you guys are able to put sequence numbers on your videos then it will be very comfortable for the viewers.

[@akshaychavan5511]

I understood this concept earlier, but was struggling in remembering generalized formula for number of matchings possible in a complete graph. But, now I'm clear with it! Thanks to you for making it such easy for me ❤

[@RaushanKumar-gt9ly]

Thanku so much ma'am

[@shivanshusuryakar8692]

for the first term it has (2n-1) choices so it should be (2n-1)! than 2n!

[@uddeshya98]

The numerator and denominator were multiplied by even numbers to make it 2n!