A unified Erd\H{o}s-P\'osa theorem for constrained cycles
Tony Huynh, Felix Joos, Paul Wollan

TL;DR
This paper generalizes the Erdős-Pósa theorem to doubly group-labeled graphs, establishing a unified framework for packing constrained cycles and identifying obstructions to the Erdős-Pósa property.
Contribution
It introduces a generalization of the Flat Wall Theorem for doubly group-labeled graphs and characterizes obstructions to the Erdős-Pósa property for various constrained cycles.
Findings
Half-integral Erdős-Pósa property holds for certain non-zero cycles.
Full Erdős-Pósa property applies to specific cycle classes on surfaces.
Reveals canonical obstructions for constrained cycle packings.
Abstract
A doubly group-labeled graph is an oriented graph with its edges labeled by elements of the direct sum of two groups . A cycle in a doubly group-labeled graph is -non-zero if it is non-zero in both coordinates. Our main result is a generalization of the Flat Wall Theorem of Robertson and Seymour to doubly group-labeled graphs. As an application, we determine all canonical obstructions to the Erd\H{o}s-P\'osa property for -non-zero cycles in doubly group-labeled graphs. The obstructions imply that the half-integral Erd\H{o}s-P\'osa property always holds for -non-zero cycles. Moreover, our approach gives a unified framework for proving packing results for constrained cycles in graphs. For example, as immediate corollaries we recover the Erd\H{o}s-P\'osa property for cycles and -cycles and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Computability, Logic, AI Algorithms
