Exact formula conjecture for the rainbow-saturation coefficient

About 4 years old · traced to

For each integer k≥4k\geq 4, let f(k)f(k) be the auxiliary extremal function from the paper and let αk+2\alpha_{k+2} be the coefficient in the asymptotic formula for rainbow saturation, so that sat⁡(n,R(Kk+2))=αk+2n+O(1)\operatorname{sat}(n,\mathcal{R}(K_{k+2}))=\alpha_{k+2}n+O(1). Exact coefficient conjecture. For every k≥4k\geq 4,

αk+2=f(k)=k+⌈−1+4k−32⌉.\alpha_{k+2}=f(k)=k+\left\lceil\frac{-1+\sqrt{4k-3}}{2}\right\rceil.

This conjecture is proposed as a way to close the gap between the lower and upper bounds for rainbow saturation by determining the auxiliary function f(k)f(k) exactly. The supplied text does not state whether it has been resolved.

References

Primary source

Debsoumya Chakraborti, Kevin Hendrey, Ben Lund and Casey Tompkins, “Rainbow saturation for complete graphs”, arXiv:2212.04640 (2024).

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.