2026-07-23T08:19:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3417 2024-03-06T10:34:10Z ddc:004 open_access

Edge-disjoint Odd Cycles in 4-edge-connected Graphs Kawarabayashi, Ken-ichi Kobayashi, Yusuke odd-cycles disjoint paths problem Erdös-Posa property packing algorithm 4-edge-connectivity Finding edge-disjoint odd cycles is one of the most important problems in graph theory, graph algorithm and combinatorial optimization. In fact, it is closely related to the well-known max-cut problem. One of the difficulties of this problem is that the Erdös-Pósa property does not hold for odd cycles in general. Motivated by this fact, we prove that for any positive integer k, there exists an integer f(k) satisfying the following: For any 4-edge-connected graph G=(V,E), either G has edge-disjoint k odd cycles or there exists an edge set F subseteq E with |F| <= f(k) such that G-F is bipartite. We note that the 4-edge-connectivity is best possible in this statement. Similar approach can be applied to an algorithmic question. Suppose that the input graph G is a 4-edge-connected graph with n vertices. We show that, for any epsilon > 0, if k = O ((log log log n)^{1/2-epsilon}), then the edge-disjoint k odd cycle packing in G can be solved in polynomial time of n. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ken-ichi Kawarabayashi and Yusuke Kobayashi 2012 Is Part Of LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2012.206 urn:nbn:de:0030-drops-34173 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.206 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode