The Strengthened Hanna Neumann Conjecture I: A Combinatorial Proof

2010/03/30 by Friedman, Joel
#05C99 #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1003.5739

Abstract

We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in a succession of simplifications of the cohomological approach. Our proof is inductive, and requires Tardos' previous result settling the rank two case of the conjecture.

Related

• A Proof of the Strengthened Hanna Neumann Conjecture
• Sheaves on Graphs, Their Homological Invariants, and a Proof of the\n Hanna Neumann Conjecture
• Sheaves on Graphs and Their Homological Invariants
• Lectures on the cohomology of reciprocity sheaves
• Hodge cohomology of invertible sheaves