Erdös–Pósa property of cycles that are far apart
Abstract
Abstract We prove that there exist functions such that for all nonnegative integers and , for every graph , either contains cycles such that vertices of different cycles have distance greater than in , or there exists a subset of vertices of with such that is a forest, where denotes the set of vertices of having distance at most from a vertex of .
Fields of Study & Subjects
Advanced Differential Equations and Dynamical Systems
Computability
Logic
AI Algorithms
Publication details
- Journal / source
- Journal of the London Mathematical Society
- Volume
- 114
- Issue
- 2
- Publication date
- 1 August 2026
- Language
- EN