On the chromatic number of a random hypergraph (Q2347844): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56323772, #quickstatements; #temporary_batch_1712201099914
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1208.0812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705349 / 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: Upper-bounding the \(k\)-colorability threshold by counting covers / 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: The first cycles in an evolving graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Perfect Matchings in Random Lifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds for constraint satisfaction problems and homomorphisms / 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: Constrained Critical Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5542885 / rank
 
Normal rank

Revision as of 04:28, 10 July 2024

scientific article
Language Label Description Also known as
English
On the chromatic number of a random hypergraph
scientific article

    Statements

    On the chromatic number of a random hypergraph (English)
    0 references
    0 references
    0 references
    0 references
    10 June 2015
    0 references
    hypergraph
    0 references
    colouring
    0 references
    chromatic number
    0 references
    uniform hypergraph
    0 references
    random hypergraph
    0 references

    Identifiers

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