Spectrum regularity conjecture for rainbow cycle lengths
Spectrum regularity conjecture for rainbow cycle lengths
Let be a spectrum of rainbow cycle lengths, namely the set of cycle lengths occurring as rainbow cycles under a fixed edge-coloring. Spectrum regularity conjecture. The asymptotic behavior of should be classified into exactly one of the following three categories: (a) contains all sufficiently large numbers; (b) contains all sufficiently large even numbers; or (c) contains all sufficiently large numbers congruent to . Equivalently, in terms of monoids, the spectrum should become regular modulo one, two, or four.
Sources & referencesView supporting material
Primary source
Boris Alexeev, “On lengths of rainbow cycles”, arXiv:math/0507456 (2006).
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
Sign in to submit a solution.
No solutions have been posted yet.