All finite sets are Ramsey in the maximum norm

@article{Kupavskii2021AllFS,
  title={All finite sets are Ramsey in the maximum norm},
  author={Andrey B. Kupavskii and A. A. Sagdeev},
  journal={Forum of Mathematics, Sigma},
  year={2021},
  volume={9}
}
Abstract For two metric spaces $\mathbb X$ and $\mathcal Y$ the chromatic number $\chi ({{\mathbb X}};{{\mathcal{Y}}})$ of $\mathbb X$ with forbidden $\mathcal Y$ is the smallest k such that there is a colouring of the points of $\mathbb X$ with k colors that contains no monochromatic copy of $\mathcal Y$. In this article, we show that for each finite metric space $\mathcal {M}$ that contains at least two points the value $\chi \left ({{\mathbb R}}^n_\infty; \mathcal M \right )$ grows… 
Max-norm Ramsey Theory
Given a metric space M that contains at least two points, the chromatic number χ (Rn∞,M) is defined as the minimum number of colours needed to colour all points of an n−dimensional space Rn∞ with the
Two-colorings of the normed spaces without long monochromatic unit arithmetic progressions
Given a natural n, we construct a two-coloring of an n-dimensional space with the maximum metric satisfying the following. For any finite set of reals S with diameter greater than 5 such that the
On Ramsey Numbers for Arbitrary Sequences of Graphs
Abstract In this work, we study nontrivial generalizations of Ramsey numbers to the case of arbitrary sequences of graphs. For many classes of sequences, exact values or asymptotics of Ramsey numbers
Solution to a conjecture of Schmidt and Tuller on linear packings and coverings
In 2008, Schmidt and Tuller stated a conjecture concerning optimal packing and covering of integers by translates of a given three-point set. In this note, we confirm their conjecture and relate it
New Turán Type Bounds for Johnson Graphs

References

SHOWING 1-10 OF 45 REFERENCES
Exponentially Ramsey Sets
TLDR
For some sets, for the first time, explicit exponentially growing lower bounds are obtained for the corresponding chromatic numbers of spaces with forbidden monochromatic sets.
Transitive sets in Euclidean Ramsey theory
On the chromatic numbers of small-dimensional Euclidean spaces
Coloring Distance Graphs and Graphs of Diameters
In this chapter, we discuss two classical problems lying on the edge of graph theory and combinatorial geometry. The first problem is due to E. Nelson. It consists of coloring metric spaces in such a
On the chromatic number of Rn with an arbitrary norm
The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators
Merry-Go-Round.- A Story of Colored Polygons and Arithmetic Progressions.- Colored Plane.- Chromatic Number of the Plane: The Problem.- Chromatic Number of the Plane: An Historical Essay.-
A partition property of simplices in Euclidean space
In a series of papers, Erdos et al. [E] have investigated this property. They have shown that all Ramsey sets are spherical, that is, every Ramsey set is contained in an appropriate sphere. On the
On a Frankl-Wilson theorem and its geometric corollaries
We find a new analogue of the Frankl-Wilson theorem on the independence number of distance graphs of some special type. We apply this new result to two combinatorial geometry problems. First, we
Intersection theorems with geometric consequences
TLDR
It is proved that ifℱ is a family ofk-subsets of ann-set, μ0, μ1, ..., μs are distinct residues modp (p is a prime) such thatk ≡ μ0 (modp) and forF ≠ F′ ≠ℽ there is one set within which all the distances are realised.
...
...