On a generalization of Rubin's theorem (Q3018075): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Choice Numbers of Graphs: a Probabilistic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic value of the choice number of complete multi‐partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choosability of complete multipartite graphs with part size three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for colourings of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of panchromatic colourings for uniform hypergraphs / rank
 
Normal rank

Latest revision as of 07:07, 4 July 2024

scientific article
Language Label Description Also known as
English
On a generalization of Rubin's theorem
scientific article

    Statements

    Identifiers

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