Quasi-isometries between graphs and trees

DOI10.1016/J.JCTB.2007.06.008zbMath1205.05071OpenAlexW2143304429MaRDI QIDQ947727

Rögnvaldur G. Möller, Bernhard Krön

Publication date: 7 October 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.06.008

zbMATH Keywords

treequasi-isometryquasi-geodesicends of graphsd-fiber

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Combinatorial aspects of finite geometries (05B25) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (8)

Two-ended quasi-transitive graphs ⋮ Surviving ends in Bernoulli percolation on graphs roughly isometric to a tree ⋮ A Stallings type theorem for quasi-transitive graphs ⋮ Minor exclusion in quasi-transitive graphs ⋮ Group actions on metric spaces: fixed points and free subgroups ⋮ Spanning trees in hyperbolic graphs ⋮ Analogues of Cayley graphs for topological groups ⋮ Asymmetrically weighted graphs, asymmetric metrics and large scale geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs and groups with tree-like properties
• The Hadwiger number of infinite vertex-transitive graphs
• Vertex-transitive graphs and accessibility
• Graph-theoretical versus topological ends of graphs.
• On translations of double rays in graphs
• Über unendliche Wege in Graphen
• Vertex-transitive graphs
• Automorphisms and endomorphisms of infinite locally finite graphs
• Über die Enden diskreter Räume und Gruppen
• Decomposing Ends of Locally Finite Graphs
• Metric ends, fibers and automorphisms of graphs
• Quasi-isometries between non-locally-finite graphs and structure trees

This page was built for publication: Quasi-isometries between graphs and trees