Keevash–Mubayi–Sudakov–Verstraëte rainbow-cycle conjecture
Let be a properly edge-colored graph on vertices, meaning that no two edges incident with the same vertex have the same color. A rainbow cycle is a cycle whose edges all have distinct colors.
Keevash–Mubayi–Sudakov–Verstraëte conjecture. There is a constant such that every properly edge-colored -vertex graph with at least edges contains a rainbow cycle.
The statement is motivated by a construction with edges and is presented as the conjectured sharp order of magnitude. Its resolution is not given in the supplied text.
References
2 papers in this index state this conjecture (2024). The statement above is taken from the most recent of them; the others are arXiv:2401.10865.
Source: Benny Sudakov, “Restricted subgraphs of edge-colored graphs and applications”, arXiv:2412.13945 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.