OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Hadwiger–Nelson problem

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Graph coloring
 0 By others on same topic  0 Discussions  1970-01-01  See my version
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

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook