Rainbow Spanning Trees in Randomly Colored \(Gₖ₋ₒᵤₜ\)

.Given a graph \(G=(V,E)\) on \(n\) vertices and an assignment of colors to its edges, a set of edges \(S ⊆ E\) is said to be rainbow if edges from \(S\) have pairwise different colors assigned to them. In this paper, we investigate rainbow spanning trees in randomly colored random \(Gₖ₋ₒᵤₜ\) graphs.Keywordsrainbow structuresspanning trees\(Gₖ₋ₒᵤₜ\) processrandom graphsMSC codes05C80