Normalising graphs of groups
Abstract
We discuss a partial normalisation of a finite graph of finite groups which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the study of finitely generated virtually free groups. Applications discussed here include (i) an important inequality for the number of edges in a Stallings decomposition of a finitely generated virtually free group, (ii) the proof of equivalence of a number of conditions for such a group to be `large', as well as (iii) the classification up to isomorphism of virtually free groups of (free) rank . We also discuss some number-theoretic consequences of the last result.
Cite
@article{arxiv.1608.03538,
title = {Normalising graphs of groups},
author = {Christian Krattenthaler and Thomas W. Müller},
journal= {arXiv preprint arXiv:1608.03538},
year = {2018}
}
Comments
16 pages, AmS-LaTeX. arXiv admin note: substantial text overlap with arXiv:1404.1258