Estimate for the chromatic number of Euclidean space with several forbidden distances
From MaRDI portal
Publication:325532
DOI10.1134/S0001434616050151zbMATH Open1354.05043OpenAlexW2460875782MaRDI QIDQ325532FDOQ325532
Publication date: 18 October 2016
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434616050151
Recommendations
- Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
Cites Work
Cited In (15)
- Yet another species of forbidden-distances chromatic number
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- New lower bound for the chromatic number of a rational space with one and two forbidden distances
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- Distance graphs with large chromatic number and without cliques of given size in the rational space
- Chromatic numbers of spheres
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size
- Turán-type bounds for distance graphs
- Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
This page was built for publication: Estimate for the chromatic number of Euclidean space with several forbidden distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325532)