Problem 24

Define S to be a set of vertices. We attempt ot make S contain all vertices and make all points
wihtin it satisfy the conditions.
First, choose an arbitrary vertex A, and consider a path from A. We label the edges on the path
1, 2, . . . , k, and suppose the path ends at vertex B such that every edge in B is labelled.
Any vertices on the path, but not equal to D or C are satisfactory for the same reason as before.
Also, C is satisfactory since C is already in S. D is satisfactory since either it appears in S, or it
appears on the new path, or it has degree 1. So, all vertices in S are satisfactory.
Now, we choose a vertex such that at least one edge is unlabelled. If this cannot be done, then note
that there cannot exist another vertex not on the path, since it would
So, all vertices in S are satisfactory.
Again, note that if there does not exist an unlabelled edge from any vertex in S, then we are done,
since all its vertices are satisfactory.
If there does, then again, we repeat the same process by choosing a C and adding at least one more
vertex to S.
Since the size of S strictly increases, there must exist a point where all vertices are in S. Then,
since all vertices in S must be satisfactory, then we are done.