Large monochromatic components and long monochromatic cycles in random hypergraphs. (February 2019)

• Record Type: Journal Article
• Authors: Bennett, Patrick; DeBiasio, Louis; Dudek, Andrzej; English, Sean
• Is Part Of: European journal of combinatorics. Volume 76(2019)
• Page Start: 123
• Page End: 137
• Publication Date: 2019-02
• Subjects: Combinatorial analysis -- Periodicals; Analyse combinatoire -- Périodiques; Combinatorial analysis; Periodicals; Electronic journals; 511.6
• DOI: 10.1016/j.ejc.2018.10.001
• Languages: English
• ISSNs: 0195-6698

Abstract

Abstract: We extend results of Gyárfás and Füredi on the largest monochromatic component in r -colored complete k -uniform hypergraphs to the setting of random hypergraphs. We also study long monochromatic loose cycles in r -colored random hypergraphs. In particular, we obtain a random analog of a result of Gyárfás, Sárközy, and Szemerédi on the longest monochromatic loose cycle in 2-colored complete k -uniform hypergraphs.