Upper Bounds for the Chromatic Numbers of Euclidean Spaces with Forbidden Ramsey Sets
- 作者: Prosanov R.I.1
-
隶属关系:
- Lomonosov Moscow State University
- 期: 卷 103, 编号 1-2 (2018)
- 页面: 243-250
- 栏目: Article
- URL: https://journals.rcsi.science/0001-4346/article/view/150598
- DOI: https://doi.org/10.1134/S000143461801025X
- ID: 150598
如何引用文章
详细
The chromatic number of a Euclidean space ℝn with a forbidden finite set C of points is the least number of colors required to color the points of this space so that no monochromatic set is congruent to C. New upper bounds for this quantity are found.
补充文件
