Normalising graphs of groups

Abstract

We discuss a partial normalisation of a finite graph of finite groups ((-), X) 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 π1((-), X) 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 2. We also discuss some number-theoretic consequences of the last result.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…