On chromatic numbers of close-to-Kneser distance graphs (Q2364457): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710496893715
ReferenceBot (talk | contribs)
Changed an Item
 
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: Research Problems in Discrete Geometry / 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: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of edges in a uniform hypergraph with one forbidden intersection / 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: 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: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Triangles are Ramsey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Partition Property of Simplices in Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a space with forbidden equilateral triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring some finite sets in {R}^{n} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers and chromatic numbers of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler / 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 complete nontrivial-intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765777 / rank
 
Normal rank

Latest revision as of 03:36, 14 July 2024

scientific article
Language Label Description Also known as
English
On chromatic numbers of close-to-Kneser distance graphs
scientific article

    Statements

    On chromatic numbers of close-to-Kneser distance graphs (English)
    0 references
    0 references
    0 references
    21 July 2017
    0 references
    Kneser graphs
    0 references
    independence sets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers