论文标题
彩虹在随机颜色$ g_ {k-out} $中跨越树木
Rainbow spanning trees in randomly coloured $G_{k-out}$
论文作者
论文摘要
给定$ n $顶点上的图形$ g =（v，e）$，以及边缘的颜色分配，如果$ s $的边缘分配给他们的成对颜色，则一组边缘$ s \ subseteq e $ $ ne Bainbow是彩虹。在本文中，我们研究了彩虹跨越树木的随机颜色随机$ 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.
