File Exchange

image thumbnail

Perfect Matchings of a Complete Graph

version (144 KB) by Daniel R. Herber
Recursive algorithm for the (N-1)!! perfect matchings of Kn and incomplete listings for large N


Updated 18 Nov 2016

GitHub view license on GitHub

Cite As

Daniel R. Herber (2020). Perfect Matchings of a Complete Graph (, GitHub. Retrieved .

Comments and Ratings (3)


Hello Upendra Tyagi, thank you for looking at my submission. Can you provide specific information on what you like and dislike about the submission per the comment guidelines?


Title fix.

Moved the submission to github.

Added InversePerfectMatchings function. Fixed some typos with N!! instead of (N-1)!!

Description formating and fixed mistake in image

MATLAB Release Compatibility
Created with R2015a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Inspired: PM Architectures Project