Colouring the real line (Q800371)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3875313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring the real line |
scientific article; zbMATH DE number 3875313 |
Statements
Colouring the real line (English)
0 references
1985
0 references
We discuss the problem of colouring the real line so that the distance between like coloured numbers does not lie in some specified set \(D\), called the distance set. In particular, we determine the minimum number of colours needed for various distance sets. The errata correct construction details in the proof of Theorem 4, and two other subsequent details.
0 references
chromatic number
0 references
infinite graphs
0 references
finite subgraphs
0 references
real numbers
0 references
positive integers
0 references
prime numbers
0 references
coloured numbers
0 references
distance set
0 references
0.8475976586341858
0 references
0.8254536986351013
0 references
0.7930212616920471
0 references
