Assertion: complete graph | /r/HasProperty | k 5
Facets:
Source sentences:
text: A graph is planar if it contains as a minor neither the complete bipartite graph K 3,3 (see the Three-cottage problem) nor the complete graph K 5 .