On the space chromatic number
type: Item
instance of: scholarly article
title: On the space chromatic number
zbMATH Open document ID: 1009.05058
DOI: 10.1016/S0012-365X(00)00406-4
author: Oren Nechushtan
published in: Discrete Mathematics
publication date: 2002-12-02T00:00:00Z
review text: A nice open problem is to find the minimum number of colors necessary to color the points of the Euclidean plane so that any two points of unit distance receive distinct colors. This number is known to be at least 4 (by finding a particular set of 6 points that require 4 colors) and 7 (by demonstrating a particular coloring of all the points). It is related to finding the maximum chromatic number of unit distance graphs: those graphs that immerse in the plane so that all edges are line segments of unit length. The problem generalizes nicely to all metric spaces, in particular, to \(d\)-dimensional Euclidean space. In this paper the author examines the chromatic number of 3-dimensional Euclidean space. He gives an example that shows the chromatic number is at least 6, improving the previously best known lower bound of 5. The best known upper bound is 21, an impressively large gap. He also gives a Ramsey-type result for 2-coloring 3-space.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1838948
zbMATH Keywords: chromatic number
zbMATH Keywords: Euclidean space
reviewed by: Dan S. Archdeacon
MaRDI profile type: Publication
Recommended article: On the chromatic number of a space
Recommended article: Q4014311
Recommended article: Q5460291
Recommended article: On the chromatic numbers of rational spaces
Recommended article: Q3602146
Recommended article: On the chromatic numbers of low-dimensional spaces
Recommended article: On the chromatic number for a set of metric spaces
Recommended article: Q3758854
Recommended article: Chromatic numbers of metric spaces
Recommended article: On the chromatic numbers of spheres in Euclidean spaces
description: scientific article; zbMATH DE number 1838948