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 language | English (US) |
---|---|
Pages (from-to) | 401-403 |
Number of pages | 3 |
Journal | Journal of Combinatorial Theory, Series A |
Volume | 27 |
Issue number | 3 |
DOIs | |
State | Published - Nov 1979 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics