Separation conjecture between semisaturation and packing numbers

Let ssatr(Kk+1)\mathrm{ssat}_r(K_{k+1}) be the rr-colour semisaturation parameter of Kk+1K_{k+1}, and let Pr(k)P_r(k) be the rr-colour kk-clique packing number. Let r=r(k)3r=r(k)\geq 3 be any function of kk, and write f(k)g(k)f(k)\ll g(k) when f(k)/g(k)0f(k)/g(k)\to 0 as kk\to\infty.

Separation conjecture. For any r=r(k)3r=r(k)\geq 3,

ssatr(Kk+1)Pr(k)\mathrm{ssat}_r(K_{k+1})\ll P_r(k)

as kk\to\infty.

For fixed kk and rr\to\infty, the paper proves an order-of-magnitude separation; this conjecture proposes the analogous separation in every remaining parameter range.

Sources & referencesView supporting material

Primary source

Yamaan Attwa, Sam Mattheus, Tibor Szabó and Jacques Verstraete, “Improved bounds for the minimum degree of minimal multicolor Ramsey graphs”, arXiv:2510.09068 (2025).

Progress summary

Never refreshed

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.