All finite configurations are Almost Ramsey

Joel Spencer

Research output: Contribution to journalArticlepeer-review


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
Issue number3
StatePublished - Nov 1979

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'All finite configurations are Almost Ramsey'. Together they form a unique fingerprint.

Cite this