The off-diagonal F-Ramsey conjecture
Statement
Let be a graph, and let denote the minimum number of copies of in a graph that is -Ramsey. Let be the Ramsey number, the smallest such that is -Ramsey. Off-diagonal -Ramsey conjecture. For all positive integers satisfying ,
This is the natural off-diagonal extension of the diagonal conjecture. The paper establishes the equality up to a lower-order term in the exponent when is or , using constructions related to the asymptotics of ; the full equality 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.