Even $A$-cycles have the edge-Erd\H{o}s-P\'osa property
Henning Bruhn

TL;DR
This paper proves that even cycles containing a specific vertex set have the edge-Erdős-Pósa property, extending understanding of cycle packing and covering in graph theory.
Contribution
It establishes that even A-cycles possess the edge-Erdős-Pósa property, a significant extension of known properties for cycles in graphs.
Findings
Proves even A-cycles have the edge-Erdős-Pósa property.
Extends the class of cycles known to have this property.
Provides a new insight into cycle packing and covering in graphs.
Abstract
I prove that even -cycles have the edge-Erd\H{o}s-P\'osa property.
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
TopicsComputability, Logic, AI Algorithms · Limits and Structures in Graph Theory · Advanced Topology and Set Theory
