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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5837311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Coloring Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3464534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Distance Graphs and Graphs of Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Coding Theory* / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of small-dimensional Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of low-dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements of the Frankl-Rödl theorem and geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization of distances within sets in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Erdős concerning a 3-coloring of the unit sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4098837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of spheres in Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of spheres in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lovász' theorem on the chromatic number of spheres revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Difference Between Consecutive Primes, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a sphere with spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: New estimates in the problem of the number of edges in a hypergraph with forbidden intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs / rank
 
Normal rank

Revision as of 22:31, 19 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
    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 references
    0 references
    0 references
    0 references

    Identifiers