Graph Coloring · Superchallenge problem

The Petersen graph ($10$ vertices, $15$ edges, every vertex of degree $3$) contains odd cycles (e.g. its outer rim is a $5$-cycle), so it is not bipartite. What is the minimum number of edges that must be deleted so that the remaining graph IS bipartite?