For any r-graph H, we consider the problem of finding a rainbow H-factor in an r-graph G with large minimum l-degree and an edge-colouring that is suitably bounded. We show that the asymptotic degree threshold is the same as that for finding an H-factor.
Coulson, M. [et al.]. Rainbow factors in hypergraphs. "Journal of combinatorial theory. Series A", 1 Maig 2020, vol. 172, p. 1-14.