Coloring Some Finite Sets in ℝn

József Balogh, Alexandr Kostochka, and Andrei Raigorodskii. "Coloring Some Finite Sets in ℝn." Discussiones Mathematicae Graph Theory 33.1 (2013): 25-31. <http://eudml.org/doc/267832>.

@article{JózsefBalogh2013,
abstract = {This note relates to bounds on the chromatic number χ(ℝn) of the Euclidean space, which is the minimum number of colors needed to color all the points in ℝn so that any two points at the distance 1 receive different colors. In [6] a sequence of graphs Gn in ℝn was introduced showing that . For many years, this bound has been remaining the best known bound for the chromatic numbers of some lowdimensional spaces. Here we prove that and find an exact formula for the chromatic number in the case of n = 2k and n = 2k − 1.},
author = {József Balogh, Alexandr Kostochka, Andrei Raigorodskii},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {chromatic number; independence number; distance graph},
language = {eng},
number = {1},
pages = {25-31},
title = {Coloring Some Finite Sets in ℝn},
url = {http://eudml.org/doc/267832},
volume = {33},
year = {2013},
}

TY - JOUR
AU - József Balogh
AU - Alexandr Kostochka
AU - Andrei Raigorodskii
TI - Coloring Some Finite Sets in ℝn
JO - Discussiones Mathematicae Graph Theory
PY - 2013
VL - 33
IS - 1
SP - 25
EP - 31
AB - This note relates to bounds on the chromatic number χ(ℝn) of the Euclidean space, which is the minimum number of colors needed to color all the points in ℝn so that any two points at the distance 1 receive different colors. In [6] a sequence of graphs Gn in ℝn was introduced showing that . For many years, this bound has been remaining the best known bound for the chromatic numbers of some lowdimensional spaces. Here we prove that and find an exact formula for the chromatic number in the case of n = 2k and n = 2k − 1.
LA - eng
KW - chromatic number; independence number; distance graph
UR - http://eudml.org/doc/267832
ER -