Covering odd cycles

We estimate the number of vertices/edges necessary to cover all odd cycles in graphs of given order and odd girth.