Counting cycles in labeled graphs: the nonpositive immersion property for one-relator groups

DOI10.1093/IMRN/RNV208MaRDI QIDQ4560431zbMATH OpenOpenAlexFDO

Authors Joseph Helfer, Daniel T. Wise

Publication date 12 December 2018

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.2579

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Planar graphs; geometric and topological aspects of graph theory (05C10) Free nonabelian groups (20E05)

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.

Recommendations

• The Coherence of One-Relator Groups with Torsion and the Hanna Neumann Conjecture
• Stackings and the \(W\)-cycles conjecture
• Graphs, free groups and the Hanna Neumann conjecture
• A bound for the number of one-relator groups of corank 1
• scientific article; zbMATH DE number 4190013

Cited in

(7)

• Stackings and the \(W\)-cycles conjecture
• COHERENCE, LOCAL INDICABILITY AND NONPOSITIVE IMMERSIONS
• Good stackings, bislim structures and invariant staggerings
• Coherence and one-relator products of locally indicable groups
• Uniform negative immersions and the coherence of one-relator groups
• Criteria for the vanishing of H_2^(2)
• Negative immersions for one-relator groups

This page was built for publication: Counting cycles in labeled graphs: the nonpositive immersion property for one-relator groups

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