Hadwiger–Nelson Problem: OpenAI’s Breakthrough Shows the Euclidean Plane Is Not Five-Colorable

Hadwiger–Nelson Problem cover art: a unit-distance graph on a plane with five colors failing at one point

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

Barnette’s Conjecture: Inside OpenAI’s Surprising Proof and Why It Matters

Glowing loop through a planar graph illustrating Barnette’s Conjecture and OpenAI’s proof claim

A graph can give every vertex exactly two selected connections and still leave you going around several separate loops. Getting one loop through the entire graph is the hard part. For decades, that distinction has kept a deceptively simple mathematical question open. Barnette’s Conjecture asks whether every cubic, bipartite, planar, 3-vertex-connected graph contains a Hamiltonian … Read more