Cutting up graphs
- Cite this article as:
- Dunwoody, M.J. Combinatorica (1982) 2: 15. doi:10.1007/BF02579278
- 107 Downloads
LetΓ be infinite connected graph with more than one end. It is shown that there is a subsetd ⊂V Γ which has the following properties. (i) Bothd andd*=VΓ\d are infinite. (ii) there are only finitely many edges joiningd andd*. (iii) For eachgε AutΓ at least one ofd⊂dg, d*⊂dg, d⊂d* g, d*⊂d* g holds. Any group acting on Γ has a decomposition as a free product with amalgamation or as an HNN-group.