Counting cycles in labeled graphs: The nonpositive immersion property for one-relator groups
classification
🧮 math.GR
keywords
immersionnonpositiveone-relatorpropertycomplexcomplexescountingcycles
read the original abstract
We prove a rank 1 version of the Hanna Neumann Theorem. This shows that every one-relator 2-complex without torsion has the nonpositive immersion property. The proof generalizes to staggered and reducible 2-complexes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.