Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"Accessibility of Groups"”.
-
Acylindrical and strong accessibility
Weidmann has produced a bound on the number of edges of a graph of groups splitting for when a finitely generated group acts on a tree (𝑘,𝐶)-acylindrically [25]. In the same paper Weidmann conjectures a common generalisation between their result and a theorem of Bestvina and Feighn [2]; which …