Assertion: graph's node | /r/HasProperty | joined by k-1 edges
Facets:
Source sentences:
text: Here we are using tree as a graph theorist would, to mean a set of k nodes joined by k-1 edges; this is similar to trees used in data structures except that there are no limits on the number of children a node can have and no ordering constraints within the tree.