Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)
Deepak Bal, ALAN M. FRIEZE, Paweł Prałat · SIAM Journal on Discrete Mathematics · 2024
Abstract. Given a graph [Formula: see text] on [Formula: see text] vertices and an assignment of colors to its edges, a set of edges [Formula: see text] is said to be rainbow if edges from [Formula: see text] have pairwise different colors assigned to them. In this paper, we investigate rainbow spanning trees in randomly colored random [Formula: see text] graphs.