Geometry & Topology 9 (2005) 1835–1880

DOI: 10.2140/gt.2005.9.1835

arXiv: math.GR/0510198

Abstract

A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free groups. In particular, it is possible to decide if such a group is free.

Keywords

graph of groups, Grushko decomposition, algorithm, labeled graph

Mathematical Subject Classification

Primary: 20F65

Secondary: 20E05

References

Forward citations

Publication

Received: 5 February 2005
Revised: 11 September 2005
Accepted: 7 August 2005
Published: 25 September 2005
Proposed: Benson Farb
Seconded: Martin Bridson, Joan Birman

Authors