|
This article is cited in 16 scientific papers (total in 16 papers)
Upper Bounds for the Chromatic Numbers of Euclidean Spaces with Forbidden Ramsey Sets
R. I. Prosanov Lomonosov Moscow State University
Abstract:
The chromatic number of a Euclidean space $\mathbb R^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.
Keywords:
Euclidean Ramsey theory, chromatic number of space.
Received: 01.10.2016 Revised: 07.02.2017
Citation:
R. I. Prosanov, “Upper Bounds for the Chromatic Numbers of Euclidean Spaces with Forbidden Ramsey Sets”, Mat. Zametki, 103:2 (2018), 248–257; Math. Notes, 103:2 (2018), 243–250
Linking options:
https://www.mathnet.ru/eng/mzm11397https://doi.org/10.4213/mzm11397 https://www.mathnet.ru/eng/mzm/v103/i2/p248
|
Statistics & downloads: |
Abstract page: | 430 | Full-text PDF : | 63 | References: | 48 | First page: | 21 |
|