@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 \textbackslash{}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 \textbackslash{}mathrm\{S\}\textbackslash{}mathrm\{o\}\textbackslash{}mathrm\{c\}\textbackslash{}mathrm\{i\}\textbackslash{}mathrm\{e\}\textbackslash{}mathrm\{t\}\textbackslash{}mathrm\{y\} \textbackslash{}mathrm\{f\}\textbackslash{}mathrm\{o\}\textbackslash{}mathrm\{r\} \textbackslash{}mathrm\{I\}\textbackslash{}mathrm\{n\}\textbackslash{}mathrm\{d\}\textbackslash{}mathrm\{u\}\textbackslash{}mathrm\{s\}\textbackslash{}mathrm\{t\}\textbackslash{}mathrm\{r\}\textbackslash{}mathrm\{i\}\textbackslash{}mathrm\{a\}\textbackslash{}mathrm\{l\} \textbackslash{}mathrm\{a\}\textbackslash{}mathrm\{n\}\textbackslash{}mathrm\{d\} \textbackslash{}mathrm\{A\}\textbackslash{}mathrm\{p\}\textbackslash{}mathrm\{p\}\textbackslash{}mathrm\{l\}\textbackslash{}mathrm\{i\}\textbackslash{}mathrm\{e\}\textbackslash{}mathrm\{d\} \textbackslash{}mathrm\{M\}\textbackslash{}mathrm\{a\}\textbackslash{}mathrm\{t\}\textbackslash{}mathrm\{h\}\textbackslash{}mathrm\{e\}\textbackslash{}mathrm\{m\}\textbackslash{}mathrm\{a\}\textbackslash{}mathrm\{t\}\textbackslash{}mathrm\{i\}\textbackslash{}mathrm\{c\}\textbackslash{}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",
}