Threshold Ramsey multiplicity conjecture for odd cycles
Statement
For a positive integer , let denote the cycle on vertices, and let be its threshold Ramsey multiplicity. Threshold Ramsey multiplicity conjecture. For any sufficiently large odd integer ,
The preceding extremal coloring gives the upper bound , while the paper proves a lower bound of for some positive constant ; determining the exact value for sufficiently large odd 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.