Random Graphs with Few Disjoint Cycles
Random Graphs with Few Disjoint Cycles
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 size at most f ( k ); that is, a set B …