Odd Vertices Determines Edge-Disjoint Trails

Theorem
Let $$G$$ be a loop-multigraph with $$2n$$ odd vertices, $$n > 0$$.

Then $$G$$ has $$n$$ edge-disjoint trails such that every edge of $$G$$ is contained in one of these trails.

Each of these trails starts and ends on an odd vertex.

Proof
First it's worth noting that from the Handshake Lemma, no graph can have an odd number of odd vertices.

We prove this result by induction:

For all $$n \in \N^*$$, let $$P \left({n}\right)$$ be the proposition that if $$G$$ has $$2n$$ odd vertices, it consists entirely of $$n$$ edge-disjoint trails, each starting and ending on an odd vertex.

Basis for the Induction

 * $$P(1)$$ is true, as this is the Condition for Graph to be Traversable. This is our basis for the induction.

Note that, from the same result, the trail starts and ends on an odd vertex.

Induction Hypothesis

 * Now we need to show that, if $$P \left({k}\right)$$ is true, where $$k \ge 1$$, then it logically follows that $$P \left({k+1}\right)$$ is true.

So this is our induction hypothesis: if $$G$$ has $$2k$$ odd vertices, it consists entirely of $$k$$ edge-disjoint trails, each starting and ending on an odd vertex.

Then we need to show: if $$G$$ has $$2 \left({k+1}\right)$$ odd vertices, it consists entirely of $$k+1$$ edge-disjoint trails, each starting and ending on an odd vertex.

Induction Step
This is our induction step:

Let $$G_{k+1}$$ be a graph with $$2\left({k+1}\right)$$ odd vertices.

Let $$u, v$$ be any pair of odd vertices in $$G_{k+1}$$.

We construct the graph $$G'_{k+1}$$ which consists of $$G_{k+1}$$ with the edge $$uv$$ added.

It can be seen that as $$u, v$$ are now even vertices, $$G'_{k+1}$$ has $$2 k$$ odd vertices.

By our induction hypothesis, we know that $$G'_{k+1}$$ consists entirely of $$k$$ edge-disjoint trails.

So, let us construct these trails: let them be $$T_1, T_2, \ldots, T_k$$.

The edge $$u v$$ must be somewhere in one of the above trails. Suppose it is in $$T_j$$.

As such a trail must start and ends on an odd vertex, $$uv$$ must be neither at the start nor the end of such a trail.

Suppose $$T_j = \left({t_1, t_2, \ldots, u, v, \ldots, t_r}\right)$$.

Then it follows that $$t_1$$ and $$t_r$$ are odd vertices.

Now we remove $$uv$$ from $$G'_{k+1}$$ so as to return to $$G_{k+1}$$.

We see that $$G_{k+1}$$ consists entirely of the edge-disjoint trails:
 * $$T_1, T_2, \ldots, T_{j-1}$$;
 * $$T_{j+1}, T_{j+2}, \ldots, T_k$$;
 * The two trails: $$\left({t_1, t_2, \ldots, u}\right)$$ and $$\left({v, \ldots, t_r}\right)$$.

That makes $$k+1$$ disjoint trails.

Also note that as $$u$$ and $$v$$ are odd vertices, both of $$\left({t_1, t_2, \ldots, u}\right)$$ and $$\left({v, \ldots, t_r}\right)$$ start and end on odd vertices.

So $$P \left({k}\right) \implies P \left({k+1}\right)$$ and the result follows by the Principle of Mathematical Induction.