Abstract
We solve four similar problems: for every fixed and large , we describe all values of such that for every -edge-coloring of the complete -partite graph there exists a monochromatic (i) cycle with vertices, (ii) cycle with at least vertices, (iii) path with vertices, and (iv) path with vertices.
This implies a generalization for large of the conjecture by Gyárfás, Ruszinkó, Sárközy and Szemerédi that for every -edge-coloring of the complete -partite graph there is a monochromatic path . An important tool is our recent stability theorem on monochromatic connected matchings.
Citation
József Balogh. Alexandr Kostochka. Mikhail Lavrov. Xujun Liu. "Long monochromatic paths and cycles in 2-edge-colored multipartite graphs." Mosc. J. Comb. Number Theory 9 (1) 55 - 100, 2020. https://doi.org/10.2140/moscow.2020.9.55
Information