Covering complete $r$-partite hypergraphs with few monochromatic components

Luke Hawranick, Ruth Luo

An edge-coloring of a hypergraph is {\em spanning} if every vertex sees every color used in the coloring. In this paper, we prove that for $k\ge 2r\ge 6$, in any spanning $k$-c…