Colouring the real line

R. B. Eggleton, P. Erdős, D. K. Skilton

Research output: Contribution to journalArticle

77 Citations (Scopus)

Abstract

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, is discussed. In particular, the minimum number of colours needed for various distance sets are determined.

Original languageEnglish
Pages (from-to)86-100
Number of pages15
JournalJournal of Combinatorial Theory. Series B
Volume39
Issue number1
DOIs
Publication statusPublished - 1985

Fingerprint

Coloring
Real Line
Colouring
Color

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Colouring the real line. / Eggleton, R. B.; Erdős, P.; Skilton, D. K.

In: Journal of Combinatorial Theory. Series B, Vol. 39, No. 1, 1985, p. 86-100.

Research output: Contribution to journalArticle

Eggleton, R. B. ; Erdős, P. ; Skilton, D. K. / Colouring the real line. In: Journal of Combinatorial Theory. Series B. 1985 ; Vol. 39, No. 1. pp. 86-100.
@article{abc214f95ff7423494b756b64d0c09be,
title = "Colouring the real line",
abstract = "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, is discussed. In particular, the minimum number of colours needed for various distance sets are determined.",
author = "Eggleton, {R. B.} and P. Erdős and Skilton, {D. K.}",
year = "1985",
doi = "10.1016/0095-8956(85)90039-5",
language = "English",
volume = "39",
pages = "86--100",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Colouring the real line

AU - Eggleton, R. B.

AU - Erdős, P.

AU - Skilton, D. K.

PY - 1985

Y1 - 1985

N2 - 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, is discussed. In particular, the minimum number of colours needed for various distance sets are determined.

AB - 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, is discussed. In particular, the minimum number of colours needed for various distance sets are determined.

UR - http://www.scopus.com/inward/record.url?scp=0001844672&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001844672&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(85)90039-5

DO - 10.1016/0095-8956(85)90039-5

M3 - Article

AN - SCOPUS:0001844672

VL - 39

SP - 86

EP - 100

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 1

ER -