Graphs of subgroups of free groups

We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks’s reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In addition, we answer a question of Culler and Shalen on ranks of intersections in free groups. The latter has also been done independently by R P Kent IV.

PDF Access Denied

Warning: We have not been able to recognize your IP address 47.88.87.18 as that of a subscriber to this journal. Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form.

Or, visit our subscription page for instructions on purchasing a subscription. You may also contact us at contact@msp.org or by using our contact form.

Or, you may purchase this single article for USD 29.95:

Keywords

folding, free groups, Hanna Neumann conjecture

Mathematical Subject Classification 2000

Primary: 20E05

References

Publication

Received: 27 August 2008

Revised: 25 January 2009

Accepted: 28 January 2009

Published: 23 February 2009

Authors

Larsen Louder
Department of Mathematics University of Michigan Ann Arbor, MI 48109-1043 USA
http://www.math.lsa.umich.edu/~llouder/
D B McReynolds
Department of Mathematics University of Chicago Chicago, IL 60637 USA
http://www.math.uchicago.edu/~dmcreyn/

Volume 9, issue 1 (2009)

Larsen Louder and D B McReynolds

Abstract