For any r-graph H, we consider the problem of finding a rainbow H-factor in an r-graph G with large minimum ℓ-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.

中文翻译：

---

图中的彩虹因素

对于任何ř -图ħ，我们考虑找一个彩虹的问题ħ在-因子- [R -图ģ与大的最小ℓ -degree和边缘着色被适当限定。我们表明，渐近度阈值与寻找H因子相同。