Füredi–Kim conjecture on saturation numbers of long cycles
Let denote the cycle graph on vertices, and let be its saturation number. Füredi–Kim conjecture. There exists a constant such that
holds for all integers . The conjecture is partially resolved in the source: for each fixed even integer , the asserted asymptotic holds with in place of ; the general statement remains open.
References
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.