Nikiforov's asymptotic cycle–complete graph Ramsey conjecture
Statement
Let denote the Ramsey number for a cycle versus a complete graph , where , , and are positive integers. Nikiforov's asymptotic Ramsey conjecture. For every there exists such that, whenever and ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.