Huang–Zhang–Chen conjecture on tree–cycle Ramsey numbers
Statement
Let be an arbitrary tree on vertices, let be a cycle on vertices, and let denote the Ramsey number of versus . Define to be the least function such that for every odd whenever . Huang–Zhang–Chen conjecture. For every odd and every ,
The known bounds are ; the conjecture asserts that the lower bound, obtained from the exact path–cycle Ramsey number, is sharp.
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.