|
On the Chromatic Number for a Set of Metric Spaces
I. M. Mitricheva (Shitova) M. V. Lomonosov Moscow State University
Abstract:
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_1$ to $l_2$.
Keywords:
metric space with a forbidden distance, chromatic number, convex optimization, Euclidean space, graph, Karush–Kuhn–Tucker theorem, Lagrange function.
Received: 15.04.2009
Citation:
I. M. Mitricheva (Shitova), “On the Chromatic Number for a Set of Metric Spaces”, Mat. Zametki, 91:3 (2012), 422–431; Math. Notes, 91:3 (2012), 399–408
Linking options:
https://www.mathnet.ru/eng/mzm8602https://doi.org/10.4213/mzm8602 https://www.mathnet.ru/eng/mzm/v91/i3/p422
|
Statistics & downloads: |
Abstract page: | 369 | Full-text PDF : | 182 | References: | 61 | First page: | 17 |
|