Ramsey threshold for trees versus odd cycles
Statement
For an odd integer , determine the least integer such that, for every integer and every tree on vertices, the Ramsey number satisfies . The conjectured exact value is for every odd .
Record
- Added
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.