Groups Complexity Cryptology
Managing Editor: Shpilrain, Vladimir / Weil, Pascal
Editorial Board: Ciobanu, Laura / Conder, Marston / Eick, Bettina / Elder, Murray / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura / Lohrey, Markus
CiteScore 2018: 0.80
SCImago Journal Rank (SJR) 2018: 0.368
Source Normalized Impact per Paper (SNIP) 2018: 1.061
Mathematical Citation Quotient (MCQ) 2018: 0.38
Cutting up graphs revisited – a short proof of Stallings' structure theorem
This is a short proof of the existence of finite sets of edges in graphs with more than one end, such that after removing them we obtain two components which are nested with all their isomorphic images. This was first done in “Cutting up graphs” [Dunwoody, Combinatorica 2: 15–23, 1982]. Together with a certain tree construction and some elementary Bass–Serre theory this yields a combinatorial proof of Stallings' theorem on the structure of finitely generated groups with more than one end.
Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.