Assertion: graph's set | /r/HasProperty | maximal independent
Facets:
Source sentences:
text: A complete bipartite graph is well covered if the two sides of its bipartition have equal numbers of vertices, for these are its only two maximal independent sets.