Rainbow spanning trees in randomly coloured $G_{k-out}$

Given a graph $G=(V,E)$ on $n$ vertices and an assignment of colours to its edges, a set of edges $S\subseteq E$ is said to be rainbow if edges from $S$ have pairwise different colours assigned to them. In this paper, we investigate rainbow spanning trees in randomly coloured random $G_{k-out}$ graphs.