Füredi–Kim conjecture on saturation numbers of long cycles
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.