Optimal packings of edge-disjoint odd cycles (Q1969787)

The purpose of this note is to consider the minimum number of edges which hit all the odd cycles and the maximum number of edge-disjoint odd cycles in a simple graph. It is proved that for the planar graphs, \(\tau_e\) (the edge-transversal number) is bounded by a function of \(\upsilon_e\) (the edge-packing number).