ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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)=k−3k−4n+O(k2)\mathrm{sat}(n,C_k)=\frac{k-3}{k-4}n+O(k^2)

holds for all integers k⩾k0k\geqslant k_0. The conjecture is partially resolved in the source: for each fixed even integer k⩾28k\geqslant28, the asserted asymptotic holds with O(1)O(1) in place of O(k2)O(k^2); 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.