Preprint
Abstract
We prove that there exist functions $f$ and $g$ such that for all positive integers $k$ and $d$, for every graph $G$ and every subset $A$ of the vertices of $G$, either $G$ contains $k$ $A$-paths such that vertices of different $A$-paths are at distance at least $d$ in $G$, or there exists a set $X$ of the vertices of $G$ with $|X|\leq f(k)$ such that every $A$-path in $G$ contains a vertex of $B_G(X,g(k,d))$.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Graph Minors and Metric SpacesCombinatorica, 2025
- A counterexample to the coarse Menger conjectureJournal of Combinatorial Theory, Series B, 2025
- A coarse Erdős-Pósa theorem2025
- A Menger-Type Theorem for Two Induced PathsSIAM Journal on Discrete Mathematics, 2024
- Frames, $A$-Paths, and the Erdös--Pósa PropertySIAM Journal on Discrete Mathematics, 2018
- On Independent Circuits Contained in a GraphCanadian Journal of Mathematics, 1965
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von GraphenActa Mathematica Hungarica, 1964