Payne–Wood's coloring conjecture for planar point sets

From papers

Let PR2P\subseteq\mathbb{R}^{2} be a set of nn points with at most n\sqrt{n} points collinear. A coloring of PP assigns a color to each point; a color class is in general position if it contains no three collinear points.

Payne–Wood's coloring conjecture. Every such set PP can be colored with O(n)O(\sqrt{n}) colors so that each color class is in general position.

This is presented as a strengthening of Payne and Wood's quadratic conjecture for the planar Ramsey number. The source does not state a resolution, so the conjecture remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

József Balogh, Felix Christian Clemen, Adrian Dumitrescu and Dingyuan Liu, “Subset Selection Problems in Planar Point Sets”, arXiv:2412.14287 (2024).

Solutions 0

No solutions have been posted yet.