Assertion: complete graph | /r/HasProperty | k n
Facets:
Source sentences:
text: The number of perfect matchings of the complete graph K n (with n even) is given by the double factorial (n − 1)!!.