The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs (Q2455139)

The paper studies the chromatic number of \({\mathbb R}^n\), a problem posed by Erdős, Hadwiger, Nelson and Isbell. This is defined as the chromatic number of an infinite graph, whose vertices are the points of \({\mathbb R}^n\), and two vertices are joined if their distance is \(d\). The chromatic number does not depend on the choice of \(d\). Clearly every finite subgraph sets a lower bound for the chromatic number. The author considers point sets, where every point has only \(0\) or \(\pm 1\) coordinates and gives various (old and new) nontrivial lower bounds and states similar results in a substantially more general situation. Most of the new results have been distributed into the 6 remarks and 3 comments.