We present a tight lower bound on the number of edge-disjoint odd cycles in planar graphs in terms of the size of the maximum cut.
