arXiv Analytics

Sign in

arXiv:math/0701214 [math.GR]AbstractReferencesReviewsResources

Graphs, free groups and the Hanna Neumann conjecture

Brent Everitt

Published 2007-01-08, updated 2007-10-16Version 2

A new bound for the rank of the intersection of finitely generated subgroups of a free group is given, formulated in topological terms, and very much in the spirit of Stallings. The bound is a contribution to (although unfortunately not a solution of) the strengthened Hanna Neumann conjecture.

Comments: J. Group Theory (to appear)
Journal: J. Group Theory 11(6) (2008), 885-899
Categories: math.GR
Related articles: Most relevant | Search more
arXiv:2108.10814 [math.GR] (Published 2021-08-24)
On the intersections of finitely generated subgroups of free groups: reduced rank to full rank
arXiv:1608.00617 [math.GR] (Published 2016-08-01)
On rank of the join of two subgroups in a free group
arXiv:2106.11552 [math.GR] (Published 2021-06-22)
Finitely generated subgroups of free groups as formal languages and their cogrowth

Links

Toolbox