Assertion: graph's edge | /r/CapableOf | set empty set
Facets:
Source sentences:
text: A clear result of this is that the every graph G {\displaystyle G} has as subgraphs at least the empty graph and itself, as the empty graph ε {\displaystyle \varepsilon } has as its vertex and edge set the empty set, both of which are subsets of every set, and V ( G ) ⊆ V ( G ) {\displaystyle V(G)\subseteq V(G)} and E ( G )