Graphs of subgroups of free groups
classification
🧮 math.GR
keywords
freegroupsconjecturegraphssubgroupsadditionamalgamatedanswer
read the original abstract
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.
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.