Erdős Problem #197 — We conclude this topic with a very annoying question: Is it possible to partition into two sets, each of which can be permuted to avoid monotone 3-term A.P.'s?
We conclude this topic with a very annoying question: Is it possible to partition into two sets, each of which can be permuted to avoid monotone 3-term A.P.'s? If we are allowed three sets, this is possible; the corresponding situation for has not been investigated.
References
Additional references
Erdős, P. and Graham, R., Old and new problems and results in combinatorial number theory. Monographies de L'Enseignement Mathématique 28 (1980).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.