Skip to main content

and
  1. No Access

    Article

    Packing Directed Cycles Quarter- and Half-Integrally

    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 ...

    Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Paweł Rzążewski, Manuel Sorge in Combinatorica (2022)