### Edge-disjoint Odd Cycles in 4-edge-connected Graphs

Ken-Ichi Kawarabayashi & Yusuke Kobayashi
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),...