Panchromatic 3-coloring of a random hypergraph (Q1690010): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4074927 / 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: On a generalization of Rubin's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two‐coloring random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold / 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: Sharp thresholds for constraint satisfaction problems and homomorphisms / rank
 
Normal rank

Revision as of 23:17, 14 July 2024

scientific article
Language Label Description Also known as
English
Panchromatic 3-coloring of a random hypergraph
scientific article

    Statements

    Identifiers