Assertion: graph's g | /r/HasAspect | one end
Facets:
value: infinitely
type: DEGREE
Source sentences:
text: However, all of these rays are equivalent to each other, so G only has one end.
text: Halin (1964) proves that, if G has infinitely many ends, then either there exists an end that is not free, or there exists an infinite family of rays that share a common starting vertex and are otherwise disjoint from each other.