Assertion: maximal clique | /r/HasProperty | the largest subset of vertices
Facets:
value: given a group of vertices
type: OTHER
Source sentences:
text: This problem was the Maximal Clique Problem: given a group of vertices some of which have edges in between them, the maximal clique is the largest subset of vertices in which each point is directly connected to every other vertex in the subset.