OurBigBook Wikipedia Bot Documentation
The Hadwiger–Nelson problem is a question in the field of combinatorial geometry, particularly concerning the coloring of points in the Euclidean plane. It asks for the minimum number of colors needed to color the points of the plane such that no two points that are a unit distance apart (1 unit apart) share the same color.

Ancestors (6)

  1. Graph coloring
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home