Abstract
When does the Cayley graph of a finitely generated, infinite group look similar to a tree? For a locally finite, infinite graph, one can introduce different notions of “metric” type saying that it is tree-like: the graph may have (1) a “uniformly spanning tree,” (2) a certain triangulation property, or (3) all its ends may have finite diameters. After studying the interrelations between these properties for arbitrary graphs, it is proved that they are equivalent for vertex-transitive graphs. A Cayley graph has one of these properties if and only if it arises from a finite extension of a free group.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
