Even A‐cycles have the edge‐Erdős–Pósa property

DOI10.1002/jgt.22778zbMath1522.05363OpenAlexW3215358323MaRDI QIDQ6081562

Henning Bruhn

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22778

zbMATH Keywords

coveringpackingedge-disjoint cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Packing cycles through prescribed vertices under modularity constraints
• Disjoint cycles intersecting a set of vertices
• The edge-Erdős-Pósa property
• Graph minors. V. Excluding a planar graph
• Packing cycles through prescribed vertices
• Recent techniques and results on the Erdős-Pósa property
• Long cycles have the Edge-Erdős-Pósa property
• Graph Theory
• On the presence of disjoint subgraphs of a specified type
• Frames, $A$-Paths, and the Erdös--Pósa Property
• Erdös--Pósa Property for Labeled Minors: 2-Connected Minors
• On Independent Circuits Contained in a Graph
• $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property
• Orientations of infinite graphs with prescribed edge-connectivity