Max-norm Ramsey Theory
Combinatorics
2024-02-15 v3
Abstract
Given a metric space that contains at least two points, the chromatic number is defined as the minimum number of colours needed to colour all points of an -dimensional space with the max-norm such that no isometric copy of is monochromatic. The last two authors have recently shown that the value grows exponentially for all finite . In the present paper we refine this result by giving the exact value such that for all 'one-dimensional' and for some of their Cartesian products. We also study this question for infinite . In particular, we construct an infinite such that the chromatic number tends to infinity as .
Keywords
Cite
@article{arxiv.2111.08949,
title = {Max-norm Ramsey Theory},
author = {Nóra Frankl and Andrey Kupavskii and Arsenii Sagdeev},
journal= {arXiv preprint arXiv:2111.08949},
year = {2024}
}
Comments
32 pages. v3: a few modifications based on the reviews