The edge-Erdős-Pósa property
From MaRDI portal
Publication:822640
DOI10.1007/s00493-020-4071-7zbMath1488.05406arXiv1809.11038OpenAlexW3110119017MaRDI QIDQ822640
Henning Bruhn, Felix Joos, Matthias Heinlein
Publication date: 22 September 2021
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.11038
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (1)
Cites Work
- An edge variant of the Erdős-Pósa property
- Disjoint cycles intersecting a set of vertices
- Graph minors. I. Excluding a forest
- Graph minors. V. Excluding a planar graph
- A tight Erdős-Pósa function for long cycles
- Long cycles have the Edge-Erdős-Pósa property
- A unified Erdős-Pósa theorem for constrained cycles
- The Erdős-Pósa property for long circuits
- On the presence of disjoint subgraphs of a specified type
- Long cycles through prescribed vertices have the Erdős‐Pósa property
- Circumference and Pathwidth of Highly Connected Graphs
- On Independent Circuits Contained in a Graph
- $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property
This page was built for publication: The edge-Erdős-Pósa property
