Assertion: complete graph | /r/HasProperty | k 2 n
Facets:
Source sentences:
text: If k = 2 n − 1, then G is the complete graph K 2 n , and hence 1-factorable (see above).