{'fraction_non_alphanumeric': 0.06934306569343066, 'fraction_numerical': 0.04562043795620438, 'mean_word_length': 4.036697247706422, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A multipartite Ramsey number for odd cycles

In this article we study multipartite Ramsey numbers for odd cycles. Our main result is the proof that a conjecture of Gyárfás et al. (J Graph Theory 61 (2009), 12–21), holds for graphs with a large enough number of vertices. Precisely, there exists n0 such that if n⩾n0 is a positive odd integer then any two‐coloring of the edges of the complete five‐partite graph K(n − 1)/2, (n − 1)/2, (n − 1)/2, (n − 1)/2, 1 contains a monochromatic cycle of length n. © 2011 Wiley Periodicals, Inc. J Graph Theory