RAINBOW SPANNING TREES IN RANDOMLY COLORED G_{k_out}

SIAM JOURNAL ON DISCRETE MATHEMATICS（2024）

引用 0|浏览0

暂无评分

摘要

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.

查看译文

关键词

rainbow structures,spanning trees,Gk- out process,random graphs

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要

RAINBOW SPANNING TREES IN RANDOMLY COLORED Gk_out

RAINBOW SPANNING TREES IN RANDOMLY COLORED G_{k_out}