arXiv Analytics

Sign in

arXiv:math/0510151 [math.GR]AbstractReferencesReviewsResources

Retracts of vertex sets of trees and the almost stability theorem

Warren Dicks, M. J. Dunwoody

Published 2005-10-07, updated 2006-09-19Version 3

Let G be a group, let T be an (oriented) G-tree with finite edge stabilizers, and let VT denote the vertex set of T. We show that, for each G-retract V' of the G-set VT, there exists a G-tree whose edge stabilizers are finite and whose vertex set is V'. This fact leads to various new consequences of the almost stability theorem. We also give an example of a group G, a G-tree T and a G-retract V' of VT such that no G-tree has vertex set V'.

Comments: 15 pages, 0 figures. Formerly titled "Some refinements of the almost stability theorem". Version 3
Journal: J. Group Theory 10 (2007), 703-721.
Categories: math.GR
Subjects: 20E08, 05C25, 20J05
Related articles: Most relevant | Search more
arXiv:1811.00913 [math.GR] (Published 2018-11-02)
An improved proof of the Almost Stability Theorem
arXiv:1808.01391 [math.GR] (Published 2018-08-03)
Spectra of Cayley graphs
arXiv:2204.12330 [math.GR] (Published 2022-04-26)
Twin-width VII: groups