ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer kk, let CkC_k denote the cycle on kk vertices, and let m(Ck)m(C_k) be its threshold Ramsey multiplicity. Threshold Ramsey multiplicity conjecture. For any sufficiently large odd integer kk,

m(Ck)=(k−1)!/2.m(C_k)=(k-1)!/2.

The preceding extremal coloring gives the upper bound (k−1)!/2(k-1)!/2, while the paper proves a lower bound of (ck)k(ck)^k for some positive constant cc; determining the exact value for sufficiently large odd kk 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.