Large monochromatic components and long monochromatic cycles in random hypergraphs
Combinatorics
2018-07-27 v2
Abstract
We extend results of Gy\'arf\'as and F\"uredi on the largest monochromatic component in -colored complete -uniform hypergraphs to the setting of random hypergraphs. We also study long monochromatic loose cycles in -colored random hypergraphs. In particular, we obtain a random analog of a result of Gy\'arf\'as, S\'ark\"ozy, and Szemer\'edi on the longest monochromatic loose cycle in -colored complete -uniform hypergraphs.
Cite
@article{arxiv.1709.02990,
title = {Large monochromatic components and long monochromatic cycles in random hypergraphs},
author = {Patrick Bennett and Louis DeBiasio and Andrzej Dudek and Sean English},
journal= {arXiv preprint arXiv:1709.02990},
year = {2018}
}