Random graphs with few disjoint cycles

Valentas Kurauskas, Colin McDiarmid

The classical Erdős-Pósa theorem states that for each positive integer k there is an f(k) such that, in each graph G which does not have k+1 disjoint cycles, there is a blocker of…