Groups, Graphs, and the Hanna Neumann Conjecture


Submultiplicativity, an analytic property generalizing the Strengthened Hanna Neumann Conjecture (SHNC) to complexes was proved in [2] assuming the deep-fall property. This in particular implied SHNC. The purpose of this note is to write the proof of the original SHNC and purely in terms of groups and graphs. We also give explicit examples showing that the upper bound in SHNC is sharp.

Extracted Key Phrases

Cite this paper

@inproceedings{Mineyev2012GroupsGA, title={Groups, Graphs, and the Hanna Neumann Conjecture}, author={Igor Mineyev and Walter D. Neumann and Warren Dicks and Ivan Mineyev}, year={2012} }