Equivalence of the strengthened Hanna Neumann conjecture and the amalgamated graph conjecture

Research output: Contribution to journalArticleResearchpeer-review

21 Citations (Scopus)

Abstract

We show that Walter Neumann's strengthened form of Hanna Neumann's conjecture on the best possible upper bound for the rank of the intersection of two subgroups of a free group is equivalent to a conjecture on the best possible upper bound for the number of edges in a bipartite graph with a certain weak symmetry condition. We illustrate the usefulness of this equivalence by deriving relatively easily certain previously known results. © 1994 Springer-Verlag.
Original languageEnglish
Pages (from-to)373-389
JournalInventiones Mathematicae
Volume117
Issue number1
DOIs
Publication statusPublished - 1 Dec 1994

Fingerprint Dive into the research topics of 'Equivalence of the strengthened Hanna Neumann conjecture and the amalgamated graph conjecture'. Together they form a unique fingerprint.

  • Cite this