Extremal Graph Theory and Ramsey Theory · Challenge problem

The Petersen graph has $10$ vertices and $15$ edges. Split its vertices into two groups. What is the largest possible number of edges joining the two groups (the maximum cut)?