Assertion: graph's vertex | /r/CapableOf | share edge
Facets:
Source sentences:
text: Day & Sankoff (1986) describe the problem of inferring evolutionary trees as one of finding maximum cliques in a graph that has as its vertices characteristics of the species, where two vertices share an edge if there exists a perfect phylogeny combining those two characters.
text: Any undirected graph G may be represented as an intersection graph: for each vertex v i of G, form a set S i consisting of the edges incident to v i ; then two such sets have a nonempty intersection if and only if the corresponding vertices share an edge.