ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r(Cp,Kr)r(C_p,K_r) denote the Ramsey number for a cycle CpC_p versus a complete graph KrK_r, where pp, rr, and kk are positive integers. Nikiforov's asymptotic Ramsey conjecture. For every kk there exists r0=r0(k)r_0=r_0(k) such that, whenever r>r0r>r_0 and p>r1/kp>r^{1/k},

r(Cp,Kr)=(p−1)(r−1)+1.r(C_p,K_r)=(p-1)(r-1)+1.

This conjecture would substantially extend the range in which the Erdős–Faudree–Rousseau–Schelp formula is known, far beyond the linear range established in the paper. The supplied text calls it more challenging and gives no resolution.

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.