Assertion: graph's vertex | /r/HasProperty | the set of blue vertices
Facets:
Source sentences:
text: A bipartite map, such as K 3, 3 , consists of two sets of points in the two-dimensional plane such that every vertex in one set (the set of red vertices) can be connected to every vertex in the other set (the set of blue vertices) without any of the paths intersecting.