Rainbow factors in hypergraphs
2020
Abstract 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.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
28
References
5
Citations
NaN
KQI