Erdős Problem #55 — Sparse Ramsey complete sequences for more than two colours
Statement
For a fixed , obtain any nontrivial bounds on how sparse a Ramsey -complete sequence can be, where every -colouring must represent all sufficiently large integers as distinct-term sums from one colour.
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.