On the chromatic numbers of some distance graphs (Q1709876): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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 number of a space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs / 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
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: On a bound in extremal combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors / 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: On the number of edges in a uniform hypergraph with a range of permitted intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular bipartite graphs and intersecting families / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s1064562418060297 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2899886324 / rank
 
Normal rank

Latest revision as of 09:42, 30 July 2024

scientific article
Language Label Description Also known as
English
On the chromatic numbers of some distance graphs
scientific article

    Statements

    On the chromatic numbers of some distance graphs (English)
    0 references
    0 references
    0 references
    15 January 2019
    0 references
    Hadwiger-Nelson problem
    0 references

    Identifiers