Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles
From MaRDI portal
Publication:6047641
DOI10.1002/jgt.22911zbMath1522.05242arXiv2112.14065WikidataQ123272054 ScholiaQ123272054MaRDI QIDQ6047641
Publication date: 9 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.14065
Cites Work
- Unnamed Item
- Unnamed Item
- Graphs without two vertex-disjoint \(S\)-cycles
- Erdős-Pósa property of chordless cycles and its applications
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- A tight Erdős-Pósa function for long cycles
- Recent techniques and results on the Erdős-Pósa property
- Long cycles have the Edge-Erdős-Pósa property
- The Erdős-Pósa property for long circuits
- A Tighter Erdős-Pósa Function for Long Cycles
- Long cycles through prescribed vertices have the Erdős‐Pósa property
- Erdös--Pósa from Ball Packing
- On Independent Circuits Contained in a Graph
This page was built for publication: Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles