A unified Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groupsGollin, J. Pascal (Avtor) Hendrey, Kevin (Avtor) Kwon, O-joung (Avtor) Oum, Sang-il (Avtor) Yoo, Youngho (Avtor) Erdős-Pósa propertycycle packinggroup-labelled graphIn 1965, Erdős and Pósa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter and Neumann-Lara asked in 1988 to find all pairs (l, z) of integers where such a duality holds for the family of cycles of length l modulo z. We characterise all such pairs, and we further generalise this characterisation to cycles in graphs labelled with a bounded number of abelian groups, whose values avoid a bounded number of elements of each group. This unifies almost all known types of cycles that admit such a duality, and it also provides new results. Moreover, we characterise the obstructions to such a duality in this setting, and thereby obtain an analogous characterisation for cycles in graphs embeddable on a fixed compact orientable surface.20252025-11-17 15:54:54Članek v reviji22118UDK: 519.17ISSN pri članku: 0025-5831DOI: 10.1007/s00208-025-03293-5COBISS.SI-ID: 257522179sl