Hadwiger–Nelson Problem: OpenAI’s Breakthrough Shows the Euclidean Plane Is Not Five-Colorable
A flat surface, a fixed distance, and a handful of colors. That sounds like an afternoon puzzle. Mathematicians have been wrestling with it since 1950. The Hadwiger–Nelson Problem asks how many colors are needed to color every point in the plane so that points exactly one unit apart never share a color. OpenAI’s manuscript, The … Read more