← All problems

Decay-Ramsey sequence problem

Characterize the sequences a=(ai)i≥1\mathbf{a}=(a_i)_{i\geq 1} of positive real numbers such that, for every integer k≥2k\geq 2, there exists an integer NkN_k with the following property: for every n≥Nkn\geq N_k, every edge-colouring c:E(Kn)→Nc:E(K_n)\to\mathbb{N} satisfying ∣c−1(i)∣/∣E(Kn)∣≤ai\lvert c^{-1}(i)\rvert/\lvert E(K_n)\rvert\leq a_i for all i∈Ni\in\mathbb{N} contains a monochromatic copy of KkK_k. Equivalently, determine precisely which sequences satisfy a→Kk\mathbf{a}\to K_k for every k≥2k\geq 2.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

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.