Lines in Euclidean Ramsey theory (Q1739207)

Let \(\mathbb{E}^n\) denote the \(n\)-dimensional Euclidean space and \(\ell_m\) be a sequence of \(m\) points on a line with consecutive points of distance one. Write \(\mathbb{E}^n \to (\ell_2, K)\) if every red/blue-coloring of \(\mathbb{E}^n\) contains either a red isometric copy of \(\ell_2\) or a blue isometric copy of \(K\) and write \(\mathbb{E}^n \not \to (\ell_2, K)\) if there is some red/blue-coloring of \(\mathbb{E}^n\) containing neither a red copy of \(\ell_2\) nor a blue copy of \(K\). In this paper, the authors prove that if \(R > 2\) and \(K \subset \mathbb{E}^n\) satisfies (i) any two of its points have at least unit distance, (ii) its diameter is at most \(R - 1\), (iii) \(|K| > 10^{4n} \log R\), where \(\log\) is based on 2, then \(\mathbb{E}^n \not \to (\ell_2, K)\). In particular, for \(m = 10^{5n}\), it is that \(\mathbb{E}^n \not \to (\ell_2, \ell_m)\). For a function \(f: \mathbb{N} \to \mathbb{N}\), a set \(X \subset\mathbb{E}^d\) is said to be \(f\)-Ramsey if any coloring of \(\mathbb{E}^n\), \(n \geq d\), with at most \(f(n)\) colors contains a monochromatic copy of \(X\). The authors note that the following result can be obtained. For any \(f\)-Ramsey set \(X\), \(\mathbb{E}^n \to (X, K)\) for any set \(K \subset \mathbb{E}^n\) of size at most \(f(n)\). A set \(X \subset \mathbb{E}^d\) is said to be Ramsey if it is \(f\)-Ramsey for some function \(f: \mathbb{N} \to \mathbb{N}\) such that \(f(n) \to \infty\) as \(n \to \infty\). Consequently, for any Ramsey set \(X\) and any set \(K \subset \mathbb{E}^m\), there exists \(n\) such that \(\mathbb{E}^n \to (X, K)\). A converse to this result is also given.