Multicolour ordered Ramsey conjecture for powers of paths
Statement
For positive integers , , and , let be the -th power of the path on vertices, and let denote the -colour ordered Ramsey number of . Multicolour path-power conjecture. For all , , and ,
The preceding theorem only gives a bound of the form , so the conjectured removal of the logarithmic factor remains open in the supplied text.
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.