A conjecture of Birmelé, Bondy, and Reed states that for any integer
, every graph
without two vertex‐disjoint cycles of length at least
contains a set of at most
vertices which meets all cycles of length at least
. They showed the existence of such a set of at most
vertices. This was improved by Meierling, Rautenbach, and Sasse...