On the \(s\)-colorful number of a random hypergraph (Q2662926): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a random hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings of partial Steiner systems and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random hypergraph coloring algorithms and the weak chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of panchromatic colourings for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concentration of the chromatic number of a random hypergraph / rank
 
Normal rank

Latest revision as of 00:22, 25 July 2024

scientific article
Language Label Description Also known as
English
On the \(s\)-colorful number of a random hypergraph
scientific article

    Statements