A tighter Erdös-Pósa function for long cycles

Samuel Fiorini, Audrey Herinckx

We prove that there exists a bivariate function f with f(k,l) = O(l k log k) such that for every naturals k and l, every graph G has at least k vertex-disjoint cycles of length at…