Erdős Problem #721 — Off-diagonal van der Waerden numbers
Statement
Let be the least such that every red-blue colouring of has either a red three-term arithmetic progression or a blue -term arithmetic progression. Find useful bounds for ; in particular, prove a nontrivial lower bound and determine whether for some .
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.