Lines in Euclidean Ramsey theory
Let ℓm be a sequence of m points on a line with consecutive points of distance one. For every natural number n, we prove the existence of a red/blue-coloring of En containing no red copy of ℓ2 and no blue copy of ℓm for any m≥2cn . This is best possible up to the constant c in the expo...
Autores principales: | Conlon, D, Fox, J |
---|---|
Formato: | Journal article |
Publicado: |
Springer US
2018
|
Ejemplares similares
-
More on lines in Euclidean Ramsey theory
por: Conlon, David, et al.
Publicado: (2023-07-01) -
Approximate Euclidean Ramsey theorems
por: Adrian Dumitrescu
Publicado: (2011-04-01) -
On two problems in graph Ramsey theory
por: Conlon, D, et al.
Publicado: (2012) -
On two problems in graph Ramsey theory
por: Conlon, David, et al.
Publicado: (2012) -
Ordered Ramsey numbers
por: Conlon, D, et al.
Publicado: (2016)