Answers are grounded in this paper and cite their sources.
The analysis demonstrates the existence of monochromatic even cycles in complete graphs Km, indicating limits in edge r-coloring strategies.
We prove that any r-coloring of the edges of Km contains a monochromatic even cycle, where m=3r+1 if r is odd and m=3r if r is even. We also prove that Km−1 has an r-coloring without monochromatic even cycles.
No takes yet. Share an insight, caveat, or question.
Gyárfás et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: