Packing cycles in undirected group-labelled graphs
Abstract
We prove a refinement of the flat wall theorem of Robertson and Seymour to undirected group-labelled graphs (G,γ) where γ assigns to each edge of an undirected graph G an element of an abelian group . As a consequence, we prove that -nonzero cycles (cycles whose edges sum to a non-identity element of ) satisfy the half-integral Erdos-P\'osa property, and we also recover a result of Wollan that, if has no element of order two, then -nonzero cycles satisfy the Erdos-P\'osa property. As another application, we prove that if m is an odd prime power, then cycles of length m satisfy the Erdos-P\'osa property for all integers . This partially answers a question of Dejter and Neumann-Lara from 1987 on characterizing all such integer pairs (,m).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.