Assertion: tree | /r/HasProperty | ordered by their subgraph relation
Facets:
value: partially
type: DEGREE
Source sentences:
text: The trees within a graph may be partially ordered by their subgraph relation, and any infinite chain in this partial order has an upper bound (the union of the trees in the chain).