The coarse Erdős-Pósa theorem

Source abstract

We prove the coarse Erdős-Pósa conjecture of Georgakopoulos and Papasoglu. Informally, any graph either contains many fat cycles that are pairwise far apart, or there is a small number of bounded radius balls that together hit all of them. To be more precise, if $G$ is a graph with no $q$-fat model of $k \cdot K_3$ for some $q, k \in \mathbb{N}$, then there is a set $X\subseteq V(G)$ of $\mathcal{O}(k\log k)$ vertices such that every $q$-fat model of $K_3$ in $G$ has distance $\mathcal{O}(q)$ from $X$. In another form more closely resembling Manning's theorem that characterises quasi-trees: if $G$ is a graph with no $q$-fat model of $k \cdot K_3$ for some $q, k \in \mathbb{N}$, then $G$ is $\mathcal{O}(q)$-quasi-isometric to a graph $H$ that contains a set $X\subseteq V(H)$ of $\mathcal{O}(k\log k)$ vertices such that $H-X$ is a forest. Bootstrapping this result, we further prove that every graph with no $q$-fat model of $k \cdot K_3$ is quasi-isometric to a graph with no $k \cdot K_3$ minor, where the quasi-isometry can be chosen to only have additive distortion. This result also holds for $k = \infty$. We also obtain an Erdős-Pósa theorem for long induced cycles that are far apart.