Packing cycles in undirected group-labelled graphs
Combinatorics
2024-06-25 v2
Abstract
We prove a refinement of the flat wall theorem of Robertson and Seymour to undirected group-labelled graphs where assigns to each edge of an undirected graph 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 Erd\H{o}s-P\'osa property, and we also recover a result of Wollan that, if has no element of order two, then -nonzero cycles satisfy the Erd\H{o}s-P\'osa property. As another application, we prove that if is an odd prime power, then cycles of length satisfy the Erd\H{o}s-P\'osa property for all integers . This partially answers a question of Dejter and Neumann-Lara from 1987 on characterizing all such integer pairs .
Cite
@article{arxiv.2009.11266,
title = {Packing cycles in undirected group-labelled graphs},
author = {Robin Thomas and Youngho Yoo},
journal= {arXiv preprint arXiv:2009.11266},
year = {2024}
}