All finite configurations are Almost Ramsey

Research output: Contribution to journalArticle

Abstract

We call C an Almost Ramsey configuration if for all k, ε{lunate} > 0 there exists N so that under any k-coloration of the points of RN there exists a monochromatic configuration C′ which may be transformed into a congruent copy of C by moving each point a distance at most ε{lunate}.

Original languageEnglish (US)
Pages (from-to)401-403
Number of pages3
JournalJournal of Combinatorial Theory, Series A
Volume27
Issue number3
DOIs
StatePublished - 1979

Fingerprint

Configuration
Congruent

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

All finite configurations are Almost Ramsey. / Spencer, Joel.

In: Journal of Combinatorial Theory, Series A, Vol. 27, No. 3, 1979, p. 401-403.

Research output: Contribution to journalArticle

@article{57d5c2b5715c4639a8d64944a48a47fe,
title = "All finite configurations are Almost Ramsey",
abstract = "We call C an Almost Ramsey configuration if for all k, ε{lunate} > 0 there exists N so that under any k-coloration of the points of RN there exists a monochromatic configuration C′ which may be transformed into a congruent copy of C by moving each point a distance at most ε{lunate}.",
author = "Joel Spencer",
year = "1979",
doi = "10.1016/0097-3165(79)90036-0",
language = "English (US)",
volume = "27",
pages = "401--403",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - All finite configurations are Almost Ramsey

AU - Spencer, Joel

PY - 1979

Y1 - 1979

N2 - We call C an Almost Ramsey configuration if for all k, ε{lunate} > 0 there exists N so that under any k-coloration of the points of RN there exists a monochromatic configuration C′ which may be transformed into a congruent copy of C by moving each point a distance at most ε{lunate}.

AB - We call C an Almost Ramsey configuration if for all k, ε{lunate} > 0 there exists N so that under any k-coloration of the points of RN there exists a monochromatic configuration C′ which may be transformed into a congruent copy of C by moving each point a distance at most ε{lunate}.

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

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

U2 - 10.1016/0097-3165(79)90036-0

DO - 10.1016/0097-3165(79)90036-0

M3 - Article

VL - 27

SP - 401

EP - 403

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 3

ER -