A Stallings type theorem for quasi-transitive graphs

DOI10.1016/J.JCTB.2022.05.008MaRDI QIDQ2674345zbMATH OpenOpenAlexFDO

Authors Matthias Hamann, Florian Lehner, Babak Miraftab, Tim Rühmann

Publication date 23 September 2022

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

Full work available at URL https://arxiv.org/abs/1812.06312

zbMATH Keywords

infinite graphstransitivitytree-decompositions

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)

Abstract: We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings' splitting theorem for multi-ended finitely generated groups and indeed it implies this theorem. It will also lead to a characterisation of accessible graphs in terms of tree amalgamations. We obtain applications of our results for hyperbolic graphs, planar graphs and graphs without any thick end. The application for planar graphs answers a question of Mohar in the affirmative.

Recommendations

• Cutting up graphs revisited -- a short proof of Stallings' structure theorem.
• Two-ended quasi-transitive graphs
• A descriptive construction of trees and Stallings' theorem
• End-transitive graphs
• A geometric proof of Stallings' theorem on groups with more than one end.

Cites work

• A geometric proof of Stallings' theorem on groups with more than one end.
• Accessibility and ends of graphs
• Accessibility in transitive graphs
• Canonical trees of tree-decompositions
• Cutting up graphs
• Cutting up graphs revisited -- a short proof of Stallings' structure theorem.
• Ends of graphs
• Ends of graphs. II
• Geometry of pseudocharacters.
• Graph theory
• Graphs and groups with tree-like properties
• scientific article; zbMATH DE number 3873585 (Why is no real title available?)
• scientific article; zbMATH DE number 475446 (Why is no real title available?)
• scientific article; zbMATH DE number 3381557 (Why is no real title available?)
• On Cayley graphs of virtually free groups.
• On tree-decompositions of one-ended graphs
• Pairs of relative cohomological dimension one
• Planar transitive graphs
• Quasi-isometries between graphs and trees
• The accessibility of finitely presented groups
• The Hadwiger number of infinite vertex-transitive graphs
• The planar cubic Cayley graphs
• Tree amalgamation of graphs and tessellations of the Cantor sphere
• Vertex-transitive graphs and accessibility

Cited in

(14)

• Cutting up graphs revisited -- a short proof of Stallings' structure theorem.
• A descriptive construction of trees and Stallings' theorem
• scientific article; zbMATH DE number 4075093 (Why is no real title available?)
• Two-ended quasi-transitive graphs
• Self-avoiding walks and multiple context-free languages
• Minor exclusion in quasi-transitive graphs
• The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
• Quasi-transitive \(K_{\infty}\)-minor free graphs
• Periodic colorings and orientations in infinite graphs
• Asymptotic half-grid and full-grid minors
• Self-avoiding walk is ballistic on graphs with more than one end
• Hyperfiniteness of boundary actions of relatively hyperbolic groups
• A note on the structure of locally finite planar quasi-transitive graphs
• Tree amalgamations and quasi-isometries

This page was built for publication: A Stallings type theorem for quasi-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674345)