Assertion: graph's vertex | /r/HasProperty | partitioned into two subsets
Facets:
Source sentences:
text: A complete bipartite graph is a graph whose vertices can be partitioned into two subsets V 1 and V 2 such that no edge has both endpoints in the same subset, and every possible edge that could connect vertices in different subsets is part of the graph.