Two-Colorings of a Random Hypergraph (Q5380531): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Random hypergraph coloring algorithms and the weak chromatic number / 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: Q4705318 / 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: The condensation transition in random hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concentration of 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/s0040585x97t989398 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2943309949 / rank
 
Normal rank

Latest revision as of 08:37, 30 July 2024

scientific article; zbMATH DE number 7062746
Language Label Description Also known as
English
Two-Colorings of a Random Hypergraph
scientific article; zbMATH DE number 7062746

    Statements

    Identifiers

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