## Abstract

The celebrated Erdős-Pósa theorem states that every undirected graph that does not admit a family of k vertex-disjoint cycles contains a feedback vertex set (a set of vertices hitting all cycles in the graph) of size O(klogk). The analogous result for directed graphs has been proven by Reed, Robertson, Seymour, and Thomas, but their proof yields a nonelementary dependency of the size of the feedback vertex set on the size of vertex-disjoint cycle packing. We show that we can obtain a polynomial bound if we relax the disjointness condition. More precisely, we show that if in a directed graph G there is no family of k cycles such that every vertex of G is in at most two (resp. four) of the cycles, then there exists a feedback vertex set in G of size O(k^{6}) (resp. O(k^{4})). We show also variants of the above statements for butterfly minor models of any strongly connected digraph that is a minor of a directed cylindrical grid and for quarter-integral packings of subgraphs of high directed treewidth.

Original language | English |
---|---|

Pages (from-to) | 1409-1438 |

Number of pages | 30 |

Journal | Combinatorica |

Volume | 42 |

DOIs | |

State | Published - 1 Dec 2022 |

Externally published | Yes |

## ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Computational Mathematics