# Half-integral Erd\H{o}s-P\'osa property of directed odd cycles

@article{Kawarabayashi2020HalfintegralEP, title={Half-integral Erd\H\{o\}s-P\'osa property of directed odd cycles}, author={K. Kawarabayashi and S. Kreutzer and O. Kwon and Qiqin Xie}, journal={arXiv: Combinatorics}, year={2020} }

We prove that there exists a function $f:\mathbb{N}\rightarrow \mathbb{R}$ such that every digraph $G$ contains either $k$ directed odd cycles where every vertex of $G$ is contained in at most two of them, or a vertex set $X$ of size at most $f(k)$ hitting all directed odd cycles. This extends the half-integral Erdős-Posa property of undirected odd cycles, proved by Reed [Mangoes and blueberries. Combinatorica 1999], to digraphs.

#### References

SHOWING 1-10 OF 41 REFERENCES

Packing Directed Circuits through Prescribed Vertices Bounded Fractionally

- Mathematics, Computer Science
- SIAM J. Discret. Math.
- 2012

Long cycles through prescribed vertices have the Erdős-Pósa property

- Mathematics, Computer Science
- J. Graph Theory
- 2018

Packing cycles through prescribed vertices

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 2011

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

- Mathematics, Computer Science
- SODA
- 2020

Disjoint cycles intersecting a set of vertices

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 2012

On the presence of disjoint subgraphs of a specified type

- Mathematics, Computer Science
- J. Graph Theory
- 1988