Chromatic number with several forbidden distances in the space with the _q-metric
The chromatic number of a metric space \((X,\rho)\) with forbidden distance sequence \(a\) is the minimal number of colors needed for coloring all points of the set \(X\) so that the distance between any two points of the same color is not equal to any of the numbers in the sequence \(a\). Classical chromatic number on a finite graph \(G=(V,E)\) is the case \(X=V\), \(\rho=\) graph distance between two vertices, and \(a=(1)\). So a valid coloring in this case requires that each node has a different color from its immediate neighbor. If \(a=(1,2)\), for example, then a valid coloring requires that each node has a different color from its neighbors and its neighbors of neighbors. One may ask: given a fix integer \(k\), what is the sequence \(a\) of length \(k\) that produces the maximal chromatic number? This paper gives a lower bound on this quantity for \(X=\mathbb R^n\) and \(\rho\) is the \(\ell_q\)-norm. This generalizes a result of \textit{A. M. Raigorodsky} [Russ. Math. Surv. 56, No. 1, 103--139 (2001; Zbl 1008.54018); translation from Usp. Mat. Nauk 56, No. 1, 107--146 (2001)], who obtained the bound for the case \(q=2\).
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- The chromatic number of a space with the metric l_q
- On the chromatic number for a set of metric spaces
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- Yet another species of forbidden-distances chromatic number
- A new lower bound for the chromatic number of the rational space
- The chromatic number of the space \(( {\mathbb R}^n, l_1)\)
- All finite sets are Ramsey in the maximum norm
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- On the chromatic number of metric spaces
- Borsuk's problem and the chromatic numbers of some metric spaces
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- scientific article; zbMATH DE number 5935733 (Why is no real title available?)
- On the chromatic numbers of metric spaces with few forbidden distances
- Distances forbidden by some two-coloring of \(\mathbb{Q}^ 2\)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
- On the chromatic number for a set of metric spaces
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Yet another species of forbidden-distances chromatic number
- Estimate for the chromatic number of Euclidean space with several forbidden distances
- The chromatic number of the space \(( {\mathbb R}^n, l_1)\)
- The chromatic number of a space with the metric l_q
- All finite sets are Ramsey in the maximum norm
- On the chromatic number of metric spaces
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
- Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances
This page was built for publication: Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687983)
