For every plane convex set D, there exists m such that every finite point set admits a 3-coloring in which every homothetic copy of D containing at least m points contains two…
Statement
For every plane convex set D, there exists m such that every finite point set admits a 3-coloring in which every homothetic copy of D containing at least m points contains two points of different colors.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.