Colouring the real line (Q800371): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q105698031 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(85)90039-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089701624 / rank | |||
Normal rank | |||
Latest revision as of 19:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Colouring the real line |
scientific article |
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
