Assertion: graph's edge | /r/CapableOf | connect two cliques
Facets:
Source sentences:
text: is an abstract simplicial complex ( ) with a simplex for every clique in A simplex graph is an undirected graph κ( G ) with a vertex for every clique in a graph G and an edge connecting two cliques that differ by a single vertex.
text: ) with a vertex for every clique in a graph and an edge connecting two cliques that differ by a single vertex.