Assertion: graph's number | /r/AtLocation | most two
Facets:
Source sentences:
text: As he shows, for every connected locally finite almost-symmetric graph, the number of ends is either at most two or uncountable; if it is uncountable, the ends have the topology of a Cantor set.