On the one-endedness of graphs of groups
classification
🧮 math.GR
math.GT
keywords
groupsgraphsedgevertexvirtuallyapplicationarbitraryblow
read the original abstract
We give a technical result that implies a straightforward necessary and sufficient conditions for a graph of groups with virtually cyclic edge groups to be one ended. For arbitrary graphs of groups, we show that if their fundamental group is not one-ended, then we can blow up vertex groups to graphs of groups with simpler vertex and edge groups. As an application, we generalize a theorem of Swarup to decompositions of virtually free groups.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.