Embedding rainbow trees with applications to graph labelling and decomposition

A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back more than two hundred years to the work of Euler on Latin squares. Since then rainbow structures have been the focus of extensive research and have found applications in the areas of graph labelling and decomposition. An edge-colouring is locally k-bounded if each vertex is contained in at most k edges of the same colour. In this paper we prove that any such edge-colouring of the complete graph K_n contains a rainbow copy of every tree with at most (1 − o(1))n/k vertices. As a locally k-bounded edge-colouring of K n may have only (n − 1)/k distinct colours, this is essentially tight.

As a corollary of this result we obtain asymptotic versions of two long-standing conjectures in graph theory. Firstly, we prove an asymptotic version of Ringel’s conjecture from 1963, showing that any n-edge tree packs into the complete graph K 2n+o(n) to cover all but o(n 2 ) of its edges. Secondly, we show that all trees have an almost-harmonious labelling. The existence of such a labelling was conjectured by Graham and Sloane in 1980. We also discuss some additional applications.