2018
DOI: 10.48550/arxiv.1812.06312
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Stallings' type theorem for quasi-transitive graphs

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. We obtain applications of our results for hyperbolic graphs, planar graphs and graphs without any thick end. The applicati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
6

Relationship

6
0

Authors

Journals

citations
Cited by 6 publications
(15 citation statements)
references
References 18 publications
0
15
0
Order By: Relevance
“…According to Krön and Möller [6, Theorem 2.8], every end of G is thin. Thus, [4,Theorem 7.5] and [3, Lemma 2.9] imply that G is quasi-isometric to a 3-regular tree. By Proposition 2.3, G is minor excluded.…”
Section: Corollary 22mentioning
confidence: 99%
“…According to Krön and Möller [6, Theorem 2.8], every end of G is thin. Thus, [4,Theorem 7.5] and [3, Lemma 2.9] imply that G is quasi-isometric to a 3-regular tree. By Proposition 2.3, G is minor excluded.…”
Section: Corollary 22mentioning
confidence: 99%
“…So far, the tree amalgamation do not interact with any group action. In the following, we define some notions that ensure that tree amalgamations of quasi-transitive graphs that satisfy this notion are again quasi-transitive, see [4,Lemma 5.3].…”
Section: Tree Amalgamationsmentioning
confidence: 99%
“…The question arises which quasi-transitive locally finite connected graphs are accessible. A result of [4] says that such graphs are accessible if and only if they are accessible in the sense of Thomassen and Woess [7]. (We refer to Section 2 for their definition of accessibility.)…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Lemma 2.2. [12,Corollary 4.3] Let Γ be a locally finite graph with more than one end such that a group G acts on Γ. Then there exists a tree-decomposition (T, V) with the following properties:…”
Section: Graphsmentioning
confidence: 99%