The $(k,\ell )$-rainbow index of random graphs

Qingqiong Cai, Xueliang Li, Jiangli Song

A tree in an edge colored graph is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$, $\ell$ with $k\ge 3$, the \emph{$(k…