Rainbow spanning trees in randomly colored gk-out

Authors

• Deepak Bal, Montclair State UniversityFollow
• Alan Frieze, Carnegie Mellon University
• Paweł Prałat, Toronto Metropolitan University

Document Type

Preprint

Publication Date

1-1-2024

Journal / Book Title

SIAM Journal on Discrete Mathematics

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.

DOI

10.1137/22M1537497

MSU Digital Commons Citation

Bal, Deepak; Frieze, Alan; and Prałat, Paweł, "Rainbow spanning trees in randomly colored gk-out" (2024). Department of Mathematics Faculty Scholarship and Creative Works. 248.
https://digitalcommons.montclair.edu/mathsci-facpubs/248

Rights

© The authors. Released under the CC BY-ND license (International 4.0).