Bipartite Graphs and Matchings · Challenge problem

A network has vertices $1$–$5$ and connections $12, 13, 23, 34, 35, 45$. What is the least number of connections that must be removed so that the remaining graph is bipartite (its vertices can be split into two groups with every surviving connection crossing between the groups)?