On lower bounds for the chromatic number of spheres (Q2313602)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7083164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On lower bounds for the chromatic number of spheres |
scientific article; zbMATH DE number 7083164 |
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
0.9149904251098632
0 references
0.8930949568748474
0 references
0.8648073077201843
0 references
0.8630572557449341
0 references
0.8619977235794067
0 references