On lower bounds for the chromatic number of spheres (Q2313602): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1134/s0001434619010036 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2937924169 / rank | |||
Normal rank |
Latest revision as of 09:37, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On lower bounds for the chromatic number of spheres |
scientific article |
Statements
On lower bounds for the chromatic number of spheres (English)
0 references
19 July 2019
0 references
The author considers the problem of the chromatic number of a sphere of radius \(r\) in the space \(\mathbb{R}^n\), \(\chi(S_r^{n-1})\), defined as the minimum number of colors needed to color all points of the sphere with no points of one color at distance 1 from each other. The author gives new, very valuable bounds on the parameter \(\chi(S_r^{n-1})\) (Theorems 2 and 3), much better than the ones known earlier.
0 references
chromatic number of spheres
0 references
linear-algebraic method
0 references
Frankl-Wilson theorem
0 references
Nelson-Hadwiger problem
0 references
distance graphs
0 references
0 references