We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
This journal utilises an Online Peer Review Service (OPRS) for submissions. By clicking "Continue" you will be taken to our partner site https://cup.msp.org/submit/cpc. Please be aware that your Cambridge account is not valid for this OPRS and registration is required. We strongly advise you to read all "Author instructions" in the "Journal information" area prior to submitting.
Let 
$T$ be a tree on 
$t$ vertices. We prove that for every positive integer 
$k$ and every graph 
$G$, either 
$G$ contains 
$k$ pairwise vertex-disjoint subgraphs each having a 
$T$ minor, or there exists a set 
$X$ of at most 
$t(k-1)$ vertices of 
$G$ such that 
$G-X$ has no 
$T$ minor. The bound on the size of 
$X$ is best possible and improves on an earlier 
$f(t)k$ bound proved by Fiorini, Joret, and Wood (2013) with some fast-growing function 
$f(t)$. Moreover, our proof is short and simple.