Assertion: graph's g | /r/HasProperty | forest
Facets:
Source sentences:
text: If G is a forest (that is, a graph with no finite cycles), then the intersection of any two rays is either a path or a ray; two rays are equivalent if their intersection is a ray.