Erdős Problem #508
Statement
What is the chromatic number of the plane? That is, what is the smallest number of colours required to colour such that no two points of the same colour are distance apart?
Record
- Source
- Added
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.