Large monochromatic components and long monochromatic cycles in random\n hypergraphs

We extend results of Gy\\'arf\\'as and F\\"uredi on the largest monochromatic\ncomponent in $r$-colored complete $k$-uniform hypergraphs to the setting of\nrandom hypergraphs. We also study long monochromatic loose cycles in\n$r$-colored random hypergraphs. In particular, we obtain a random analog of a\nresult of Gy\\'arf\\'as, S\\'ark\\"ozy, and Szemer\\'edi on the longest\nmonochromatic loose cycle in $2$-colored complete $k$-uniform hypergraphs.\n