Payne–Wood's coloring conjecture for planar point sets
Payne–Wood's coloring conjecture for planar point sets
Let be a set of points with at most points collinear. A coloring of 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 can be colored with 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
Sign in to submit a solution.
No solutions have been posted yet.