A proof of the two-path conjecture

Abstract

Let G be a connected graph that is the edge-disjoint union of two paths of length n, where n ≥ 2. Using a result of Thomason on decompositions of 4-regular graphs into pairs of Hamiltonian cycles, we prove that G has a third path of length n.