On the chromatic number of set systems (Q2748418): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hypergraphs with high chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Combinatorial Problem of Erdös / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal uncrowded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uncrowded hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum independence number for designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3027024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on independent sets in steiner systems / rank
 
Normal rank

Latest revision as of 20:51, 3 June 2024

scientific article
Language Label Description Also known as
English
On the chromatic number of set systems
scientific article

    Statements

    On the chromatic number of set systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 February 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    extremal set theory
    0 references
    uniform hypergraphs
    0 references
    property B
    0 references
    0 references