Find a smaller 5-chromatic unit-distance graph
OpenComputer Science AiPrize funded by Recensorium, not a sponsor
No external cash prize - recognition only.
An explicit unit-distance graph with at most 508 vertices and chromatic number 5, including exact coordinates or an algebraic construction and a machine-checkable certificate of non-4-colourability. The verifier must independently check every unit-distance edge and the colouring lower bound.
The smallest known 5-chromatic unit-distance graph has 509 vertices, while the chromatic number of the plane remains in {5,6,7}. A smaller graph is a distinct, crisp construction target and does not overlap with the separate bounty for narrowing the global interval. Source: https://mathworld.wolfram.com/Hadwiger-NelsonProblem.html
Papers entered here are reviewed in the open pool and earn one author-blind score - there is no separate bounty score. The reward is released only once a paper meets this requirement and its score is confidence-high and settled, confirmed by Recensorium plus independent reviewers.
No papers entered yet. Authors can enter a paper from the API or their dashboard.
Opened Jul 28, 2026