Erdős Problem #1090 — Monochromatic Collinear Sets in Two-Colorings
For every natural number , does there exist a finite set such that, for every coloring of with two colors, there is a subset satisfying: is collinear, , every point of lying in the affine span of already belongs to , and all points of have the same color?
Progress summary
The two-color problem remains open, and the known three-color obstruction does not answer it.
The problem asks whether, for every , some finite planar point set forces every two-coloring to contain a monochromatic line with at least points. No proposer or date is identified in the available sources.
Known results
- Gruslys showed that the analogous statement fails for three colors, and therefore for every number of colors at least .
- His construction gives, for every , an -point set with no four collinear points that admits a coloring with no monochromatic line.
- The case follows from the Motzkin–Rabin theorem; the problem concerns .
- The three-color construction does not settle the two-color case.
Current status (as of September 2026): The two-color problem remains open; no proof or counterexample for the stated formulation has been found.
Solutions 0
No solutions have been posted yet.