Assertion: clique's vertex | /r/HasProperty | connected by edge
Facets:
Source sentences:
text: Two vertices are connected by an edge if the matches that they represent are compatible with each other.
text: A chordless cycle in a graph, also called a hole or an induced cycle, is a cycle such that no two vertices of the cycle are connected by an edge that does not itself belong to the cycle.