Packing directed circuits quarter-integrally

@inproceedings{Masak2019PackingDC,
  title={Packing directed circuits quarter-integrally},
  author={Tom{\'a}{\vs} Masař{\'i}k and I. Muzi and Marcin Pilipczuk and Paweł Rzążewski and M. Sorge},
  booktitle={ESA},
  year={2019}
}
  • Tomáš Masařík, I. Muzi, +2 authors M. Sorge
  • Published in ESA 2019
  • Computer Science, Mathematics
  • The celebrated Erdős-Posa 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(k \log k)$. After being known for long as Younger's conjecture, a similar statement for directed graphs has been proven in 1996 by Reed, Robertson, Seymour, and Thomas. However, in their proof, the dependency of the size of the feedback vertex set on the size of vertex… CONTINUE READING
    1 Citations

    References

    SHOWING 1-10 OF 30 REFERENCES
    The Erdos-Posa Property for Directed Graphs
    • 12
    • PDF
    Graph minors. V. Excluding a planar graph
    • 613
    Large-treewidth graph decompositions and applications
    • 47
    • PDF
    The Directed Grid Theorem
    • 31
    • PDF
    The all-or-nothing flow problem in directed graphs with symmetric demand pairs
    • 7
    • PDF
    A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
    • Julia Chuzhoy, Shi Li
    • Mathematics, Computer Science
    • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
    • 2012
    • 43
    • PDF
    Polynomial treewidth forces a large grid-like-minor
    • 26
    • PDF