On the chromatic number for a set of metric spaces

We study the problem of finding the chromatic number of a metric space with a forbidden distance. Using the linear-algebraic technique in combinatorics and convex optimization methods, we obtain a set of new estimates and observe the change of the asymptotic lower bound for the chromatic number of Euclidean space under the continuous change of the metric from l ₁ to l ₂.