prove : Let G be a graph that has exactly 2k vertices of odd degree. Show that
there are k edge-disjoint paths each of which joins a different pair of ver-
tices of odd degree.
I have to prove this with induction on k. There is a hint that I need to strenghten my induction hypothosis but I...