The three-color homothetic-copy conjecture for convex sets

Let DD be a convex set in the plane, and call a scaled and translated copy of DD without rotation a homothetic copy of DD. Let SS be a finite set of points. The three-color homothetic-copy conjecture. For every plane convex set DD there is an mm such that any finite set of points admits a 33-coloring such that any homothetic copy of DD containing at least mm points contains two points with different colors. The disk case is stated to remain open, while the source proves the conjecture for convex polygons.

Sources & referencesView supporting material

Primary source

Balázs Keszegh and Dömötör Pálvölgyi, “Proper Coloring of Geometric Hypergraphs”, arXiv:1612.02158 (2019).

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.