Füredi–Kim conjecture on saturation numbers of long cycles

Let CkC_k denote the cycle graph on kk vertices, and let sat(n,Ck)\mathrm{sat}(n,C_k) be its saturation number. Füredi–Kim conjecture. There exists a constant k0k_0 such that

sat(n,Ck)=k3k4n+O(k2)\mathrm{sat}(n,C_k)=\frac{k-3}{k-4}n+O(k^2)

holds for all integers kk0k\geqslant k_0. The conjecture is partially resolved in the source: for each fixed even integer k28k\geqslant28, the asserted asymptotic holds with O(1)O(1) in place of O(k2)O(k^2); the general statement remains open.

Sources & referencesView supporting material

Primary source

Ali Mohammadian, Milad Poursoltani and Behruz Tayfeh-Rezaie, “On saturation numbers of complete multipartite graphs and even cycles”, arXiv:2506.09767 (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.