Chromatic numbers of Kneser-type graphs (Q2299637): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: On the chromatic numbers of small-dimensional Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding just one intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to Borsuk’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The junta method in extremal hypergraph theory and Chvátal's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Kneser graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of random subgraphs of a certain distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Coding Theory* / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: What we know and what we do not know about Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique chromatic numbers of intersection graphs / rank
 
Normal rank

Revision as of 20:55, 21 July 2024

scientific article
Language Label Description Also known as
English
Chromatic numbers of Kneser-type graphs
scientific article

    Statements

    Chromatic numbers of Kneser-type graphs (English)
    0 references
    0 references
    21 February 2020
    0 references
    chromatic numbers
    0 references
    Kneser graphs
    0 references
    Johnson graphs
    0 references
    distance graphs
    0 references
    existence of designs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references