Assertion: graph's edge | /r/CapableOf | appear as a subset of another edge
Facets:
Source sentences:
text: Special kinds of hypergraphs include: k-uniform ones, as discussed briefly above; clutters, where no edge appears as a subset of another edge; and abstract simplicial complexes, which contain all subsets of every edge.