The paper proves an Erdős–Pósa-type theorem for cycles separated by distance d: either k such cycles exist or a bounded-size vertex set whose g(d)-neighborhood deletion yields a forest.
By the inductive hypothesis, there exists B′ 1,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Erd\H{o}s--P\'{o}sa property of cycles that are far apart
The paper proves an Erdős–Pósa-type theorem for cycles separated by distance d: either k such cycles exist or a bounded-size vertex set whose g(d)-neighborhood deletion yields a forest.