Large disjoint subgraphs with the same order and size (Q1024273): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Chromatic Number of Kneser Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of the general Kneser-graph / 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: The exact bound in the Erdős-Ko-Rado theorem / rank
 
Normal rank

Latest revision as of 16:44, 1 July 2024

scientific article
Language Label Description Also known as
English
Large disjoint subgraphs with the same order and size
scientific article

    Statements

    Large disjoint subgraphs with the same order and size (English)
    0 references
    0 references
    0 references
    17 June 2009
    0 references
    vertex disjoint subgraphs
    0 references
    chromatic number
    0 references
    Kneser graph
    0 references

    Identifiers