Intersections of finitely generated free groups

From MaRDI portal





\textit{A. G. Howson} [J. Lond. Math. Soc. 29, 428-434 (1954; Zbl 0056.021)] showed that if U and V are subgroups of finite ranks m and n of a free group, then the rank of their intersection is finite, and in fact bounded in terms of m and n. Subsequently Hanna Neumann and then the reviewer [Math. Z. 119, 121-130 (1971; Zbl 0197.298)] progressively improved the bound to \[ rank(U\cap V)\leq 2(m-1)(n-1)-m+2\quad (1\leq m\leq n). \] The present paper contains a very clear purely graph-theoretical proof of this best (to date) general bound. The method of proof yields as a by- product a better bound when U and V are conjugate, and the author is also able to show that when \(m=2\), the bound n is valid for most subgroups V, in some sense.




Cited in
(33)








This page was built for publication: Intersections of finitely generated free groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701618)