Zhang et al.'s Ramsey-number conjecture for odd cycles and even wheels
Statement
Let be the cycle on vertices and let be the wheel on vertices. For integers , with odd and even, the Ramsey number is the least integer such that every red-blue coloring of the edges of contains either a red copy of or a blue copy of .
Zhang et al.'s conjecture. For integers , with odd and even,
The conjecture concerns the remaining case of asymmetric Ramsey numbers for cycles and wheels identified in the paper: odd and even with .
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.