On lower bounds for the chromatic number of spheres (Q2313602): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 06:41, 5 March 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
    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

    Identifiers