Retracts of vertex sets of trees and the almost stability theorem

Abstract

Let G be a group, let T be an (oriented) G-tree with finite edge stabilizers, and let V T denote the vertex set of T. We show that, for each G-retract V ′ of the G-set V T , 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 V T such that no G-tree has vertex set V ′. Throughout the article, let G be a group, and let N denote the set of finite cardinals, {0, 1, 2,. . .}. All our G-actions will be on the left. The following extends Definitions II.1.1 of [3] (where A is assumed to have trivial G-action).

Showing 1-8 of 8 references

Cyclic splittings of finitely presented groups and the canonical JSJ decomposition

  • E Rips, Z Sela
  • 1997

Free groups and almost equivariant maps

  • Warren Dicks, Peter Kropholler
  • 1995

Equivalence of the strengthened Hanna Neumann conjecture and the amalgamated graph conjecture

  • Warren Dicks
  • 1994

Groups acting on graphs, Cambridge Stud

  • Warren Dicks, M J Dunwoody
  • 1989
10 Excerpts

La propriété (T ) de Kazhdan pour les groupes localement compacts

  • Pierre De, La Harpe, Alain Valette
  • 1989
Showing 1-2 of 2 extracted citations