Corpus ID: 220768974

# 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 Topological Minors Half-Integrally
The Erdős–Pósa Property For Long Circuits
• Mathematics, Computer Science
• Comb.
• 2007
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
A Tighter Erdős-Pósa Function for Long Cycles
• Mathematics, Computer Science
• J. Graph Theory
• 2014
Packing cycles through prescribed vertices
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2011
A tight Erdős-Pósa function for planar minors
• Mathematics, Computer Science
• SODA
• 2019
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
• C. Thomassen
• Mathematics, Computer Science
• J. Graph Theory
• 1988