Rainbow factors in hypergraphs
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.