Skip to main content
OlympiadHQ

Browse · MathNet

Print

IMAR Mathematical Competition

Romania counting and probability

Problem

Given a positive integer , a loop of length in a graph is a list , where the are (not necessarily distinct) vertices, the are (not necessarily distinct) edges, and each joins and (indices are reduced modulo ); the loop traces an edge if for some index . Show that a connected graph with vertex set and edge set has a loop of length at most tracing every edge of the graph.
Solution
Let be a connected graph with vertex set and edge set ; may have loops and/or multiple edges. The idea is to expand at most suitable edges to pairs of edges to make into a graph on each vertex of which has an even degree. A maximal loop in tracing each edge at most once is then Eulerian, i.e., traces each edge exactly once (Euler). Read back in , i.e., identifying each cloned edge back to the original, this is the desired loop: it traces every cloned edge twice, every other edge once, and its length does not exceed .

To obtain , consider a spanning tree of , i.e., a minimal connected subgraph on . We will show that has a subgraph on such that and agree modulo 2 at all vertices; clearly, the number of edges of does not exceed the number of edges of which is . Cloning each edge of once, while keeping its end points fixed, of course, yields the desired additional edges in .

To obtain from , notice that the sums and have like parities, to infer that and disagree modulo 2 at an even number of vertices (possibly zero), say, . For each index in the range 1 through , let be the unique path in joining and , and collect together all edges of lying along an even number of the (zero, inclusive) to form the edge set of .

Finally, we show that and agree modulo 2 at all vertices. To this end, fix a vertex , and let be the set of all edges of having an end point at . For each edge in and each path , consider their edge-path incidence number on account of being congruent to 1 modulo 2 if and only if has an end point at , which is the case if and only if is one of . Consequently, and the conclusion follows.

Techniques

Graph Theory