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. 

Figures from this paper

References

SHOWING 1-10 OF 41 REFERENCES
Packing Topological Minors Half-Integrally
The Erdős–Pósa Property For Long Circuits
Packing Directed Circuits through Prescribed Vertices Bounded Fractionally
Long cycles through prescribed vertices have the Erdős-Pósa property
A Tighter Erdős-Pósa Function for Long Cycles
Packing cycles through prescribed vertices
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
A tight Erdős-Pósa function for planar minors
Disjoint cycles intersecting a set of vertices
On the presence of disjoint subgraphs of a specified type
  • C. Thomassen
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1988
...
1
2
3
4
5
...