Decay-Ramsey sequence problem
Characterize the sequences of positive real numbers such that, for every integer , there exists an integer with the following property: for every , every edge-colouring satisfying for all contains a monochromatic copy of . Equivalently, determine precisely which sequences satisfy for every .
References
- Decay-Ramsey Sequences — arXiv — Francesco Di Braccio, Simon Griffiths, Pedram Noohi, Leo Versteegen
Source: arXiv
Progress summary
A new paper begins studying which shrinking colour-frequency patterns force monochromatic cliques of every size, but it does not yet solve the problem.
The problem asks for a characterization of prescribed decaying edge-colour frequencies that force monochromatic cliques of every size. Francesco Di Braccio, Simon Griffiths, Pedram Noohi, and Leo Versteegen introduced this framework in a paper listed on October 14, 2026.
October 2026 initial results
The paper defines Decay-Ramsey sequences and proves initial results about which sequences force clique sizes. It explicitly does not provide a complete characterization, so this is progress rather than a resolution.
Current status (as of October 2026): Initial results have been published in a preprint, but the general characterization remains open.
Sources
Solutions 0
No solutions have been posted yet.