@article{b2265e6741964fa0901bdefbc64080b9,
title = "RAINBOW SPANNING TREES IN RANDOMLY COLORED Gk-out",
abstract = "Given a graph G = (V, E) on n vertices and an assignment of colors to its edges, a set of edges S \subseteq 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 Gk-out graphs.",
keywords = "G process, rainbow structures, random graphs, spanning trees",
author = "Deepak Bal and Alan Frieze and Pawe{\l} Pra{\l}at",
note = "Publisher Copyright: {\textcopyright} 2024 \mathrm{S}\mathrm{o}\mathrm{c}\mathrm{i}\mathrm{e}\mathrm{t}\mathrm{y} \mathrm{f}\mathrm{o}\mathrm{r} \mathrm{I}\mathrm{n}\mathrm{d}\mathrm{u}\mathrm{s}\mathrm{t}\mathrm{r}\mathrm{i}\mathrm{a}\mathrm{l} \mathrm{a}\mathrm{n}\mathrm{d} \mathrm{A}\mathrm{p}\mathrm{p}\mathrm{l}\mathrm{i}\mathrm{e}\mathrm{d} \mathrm{M}\mathrm{a}\mathrm{t}\mathrm{h}\mathrm{e}\mathrm{m}\mathrm{a}\mathrm{t}\mathrm{i}\mathrm{c}\mathrm{s}",
year = "2024",
doi = "10.1137/22M1537497",
language = "English",
volume = "38",
pages = "867--882",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",
}