Abstract
We compute the Hadwiger-Nelson numbers for certain number fields , that is, the smallest number of colors required to color the points in the plane with coordinates in~ so that no two points at distance from one another have the same color. Specifically, we show that , that , that despite the fact that the graph is triangle-free, and that . We also discuss some results over other fields, for other quadratic fields. We conclude with some comments on the use of the axiom of choice.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.