Axiom of choice and chromatic number of \(R^n\) (Q1775552)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Axiom of choice and chromatic number of \(R^n\) |
scientific article |
Statements
Axiom of choice and chromatic number of \(R^n\) (English)
0 references
4 May 2005
0 references
The chromatic number of the following graph is considered. The vertices are the points of the Euclidean space \({\mathbb R}^n\), the points \({\mathbf x}\) and \({\mathbf y}\) are joined if \({\mathbf x}-{\mathbf y}-\sqrt{2}{\mathbf e}_i\in {\mathbb Q}^n\) holds for some \(1\leq i\leq n\) (here \({\mathbf e}_1,\dots,{\mathbf e}_n\) is the standard basis). Assuming AC, the axiom of choice, the chromatic number is 2, it is, however, uncountable if \(\text{ AC}_{\aleph_0}\) holds and every set of reals is measurable.
0 references
chromatic number
0 references
axiom of choice
0 references
combinatorial geometry
0 references
discrete geometry
0 references
Euclidean space
0 references