A tight Erdős-Pósa function for long cycles

As a corollary, the tree-width of any graph G that does not contain k vertex-disjoint cycles of length at least l is of order O(kl+klog⁡k). This is also optimal up to constant factors and answers another question of Birmelé, Bondy, and Reed (2007).