Assertion: undirected graph | /r/CapableOf | form set s i
Facets:
Source sentences:
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.