ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers rr, tt, and nn, let PntP_n^t be the tt-th power of the path on nn vertices, and let R<r(Pnt)R_<^r(P_n^t) denote the rr-colour ordered Ramsey number of PntP_n^t. Multicolour path-power conjecture. For all rr, tt, and nn,

R<r(Pnt)=Or,t(nO(r)).R_<^r(P_n^t)=O_{r,t}\left(n^{O(r)}\right).

The preceding theorem only gives a bound of the form R<r(Pnt)≤DnCrlog⁡rR_<^r(P_n^t)\leq Dn^{Cr\log r}, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.