Tight bounds for rainbow partial $F$-tiling in edge-colored complete hypergraphs

Jinghua Deng, Jianfeng Hou, Xizhi Liu +1

For an $r$-graph $F$ and integers $n,t$ satisfying $t\le n/v(F)$, let $\mathrm{ar}(n,tF)$ denote the minimum integer $N$ such that every edge-coloring of $K_n^r$ using $N$ col…