, Volume 2, Issue 1, pp 15–23

Cutting up graphs

  • M. J. Dunwoody

DOI: 10.1007/BF02579278

Cite this article as:
Dunwoody, M.J. Combinatorica (1982) 2: 15. doi:10.1007/BF02579278


LetΓ be infinite connected graph with more than one end. It is shown that there is a subsetdV Γ which has the following properties. (i) Bothd andd*=VΓ\d are infinite. (ii) there are only finitely many edges joiningd andd*. (iii) For each AutΓ at least one ofddg, d*⊂dg, dd* g, d*d* g holds. Any group acting on Γ has a decomposition as a free product with amalgamation or as an HNN-group.

AMS subject classification (1980)

05 C 25 20 F 05 

Copyright information

© Akadémiai Kiadó 1982

Authors and Affiliations

  • M. J. Dunwoody
    • 1
  1. 1.University of SussexBrightonU.K.

Personalised recommendations