ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 1.12 (R. Graham). Let S be a set of homogeneous linear equations which is partition regular, i.e. in any r-coloring of Z there is always a non-trivial monochromatic solution to S. What is the minimum number of monochromatic solutions to S which can occur in some r-coloring of {1, 2,..., n } as a function of n and r?For example, with r = 2 and S is the single equation x + y = z, the correct answer is n2(1 + o(1)) /22 (Schoen, Roberts-Zeilberger). A random 2-coloring of {1, 2,..., n }

would give ∼ n2/16 such solutions. What happens for the equation x+y = 2 z? Are random 2-colorings best in this case? 4 COLLECTED BY ERNIE CROOT AND VSEVOLOD F. LEV

Record

Added
Links

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.