Axiom of choice and chromatic number: Examples on the plane (Q598462): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114013975, #quickstatements; #temporary_batch_1707252663060 |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:42, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Axiom of choice and chromatic number: Examples on the plane |
scientific article |
Statements
Axiom of choice and chromatic number: Examples on the plane (English)
0 references
6 August 2004
0 references
Let the vertices of the graph \(G_2\) be \({\mathbb R}^2\) with \(x\) and \(y\) joined iff \(x-y\in {\mathbb Q}^2+a\) where \(a\) is either \((\sqrt{2},0)\), \((0,\sqrt{2})\), \((\sqrt{2},\sqrt{2})\), or \((-\sqrt{2},\sqrt{2})\). It is shown that if the axiom of choice holds then the chromatic number of \(G_2\) is 4. If, however, the countable axiom of choice holds and every set of reals is Lebesgue measurable then, by Steinhaus's theorem, \(G_2\) is not even countably chromatic. A similar argument works if \(x\) and \(y\) are joined iff \(x-y\in {\mathbb Q}^2+\bigl\{(\sqrt{2},0),(0,\sqrt{2})\bigr\}\)
0 references
axiom of choice
0 references
infinite graphs
0 references
chromatic number
0 references