Fractional colourings of random hypergraphs

DOI10.4213/RM10151EMaRDI QIDQ6492369zbMATH OpenFDO

Authors Pavel A. Zakharov, D. A. Shabanov

Publication date 25 April 2024

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4213/RM10151E

zbMATH Keywords

threshold probabilities in random hypergraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• Catching the \(k\)-NAESAT threshold
• Estimating the r-colorability threshold for a random hypergraph
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold

Cited in

(1)

• Threshold probabilities for colourings of random hypergraphs

This page was built for publication: Fractional colourings of random hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492369)