Maths Olympiad Prep

Library / IMAR Mathematical Competition /2 of 4

IMAR Mathematical Competition

Combinatorics Difficulty 6.8 National Olympiad Prove it Romania

Given a positive integer kk, a loop of length kk in a graph is a list v1,e1,v2,e2,…,vk,ekv_1, e_1, v_2, e_2, \dots, v_k, e_k, where the viv_i are (not necessarily distinct) vertices, the eie_i are (not necessarily distinct) edges, and each eie_i joins viv_i and vi+1v_{i+1} (indices are reduced modulo kk); the loop traces an edge ee if e=eie = e_i for some index ii. Show that a connected graph with vertex set VV and edge set EE has a loop of length at most ∣V∣+∣E∣−1|V| + |E| - 1 tracing every edge of the graph.

Solution

Let GG be a connected graph with vertex set VV and edge set EE; GG may have loops and/or multiple edges. The idea is to expand at most ∣V∣−1|V|-1 suitable edges to pairs of edges to make GG into a graph G^\hat{G} on VV each vertex of which has an even degree. A maximal loop in G^\hat{G} tracing each edge at most once is then Eulerian, i.e., traces each edge exactly once (Euler). Read back in GG, 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 ∣V∣−1+∣E∣|V| - 1 + |E|.

To obtain G^\hat{G}, consider a spanning tree TT of GG, i.e., a minimal connected subgraph on VV. We will show that TT has a subgraph SS on VV such that deg⁡S\deg_S and deg⁡G\deg_G agree modulo 2 at all vertices; clearly, the number of edges of SS does not exceed the number of edges of TT which is ∣V∣−1|V| - 1. Cloning each edge of SS once, while keeping its end points fixed, of course, yields the desired additional edges in G^\hat{G}.

To obtain SS from TT, notice that the sums ∑v∈Vdeg⁡Tv=2∣ET∣\sum_{v \in V} \deg_T v = 2|E_T| and ∑v∈Vdeg⁡Gv=2∣E∣\sum_{v \in V} \deg_G v = 2|E| have like parities, to infer that deg⁡T\deg_T and deg⁡G\deg_G disagree modulo 2 at an even number of vertices (possibly zero), say, v1,…,vn,vn+1,…,v2nv_1, \dots, v_n, v_{n+1}, \dots, v_{2n}. For each index ii in the range 1 through nn, let αi\alpha_i be the unique path in TT joining viv_i and vi+nv_{i+n}, and collect together all edges of TT lying along an even number of the αi\alpha_i (zero, inclusive) to form the edge set of SS.

Finally, we show that deg⁡S\deg_S and deg⁡G\deg_G agree modulo 2 at all vertices. To this end, fix a vertex vv, and let E′E' be the set of all edges of TT having an end point at vv. For each edge ee in E′E' and each path αi\alpha_i, consider their edge-path incidence number
⟨e,αi⟩={1,if αi traces e,0,otherwise,and let ≡ denote congruence modulo 2 to write \langle e, \alpha_i \rangle = \begin{cases} 1, & \text{if } \alpha_i \text{ traces } e, \\ 0, & \text{otherwise,} \end{cases} \quad \text{and let } \equiv \text{ denote congruence modulo 2 to write}
deg⁡Tv−deg⁡Sv≡∑e∈E′∑i=1n⟨e,αi⟩=∑i=1n∑e∈E′⟨e,αi⟩≡{1,if v is a vi,0,otherwise,≡deg⁡Gv−deg⁡Tv, \begin{aligned} \deg_T v - \deg_S v &\equiv \sum_{e \in E'} \sum_{i=1}^n \langle e, \alpha_i \rangle = \sum_{i=1}^n \sum_{e \in E'} \langle e, \alpha_i \rangle \\ &\equiv \begin{cases} 1, & \text{if } v \text{ is a } v_i, \\ 0, & \text{otherwise,} \end{cases} \\ &\equiv \deg_G v - \deg_T v, \end{aligned}
on account of ∑e∈E′⟨e,αi⟩\sum_{e \in E'} \langle e, \alpha_i \rangle being congruent to 1 modulo 2 if and only if αi\alpha_i has an end point at vv, which is the case if and only if vv is one of vi,vi+nv_i, v_{i+n}. Consequently, deg⁡Sv≡deg⁡Gv\deg_S v \equiv \deg_G v and the conclusion follows.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.