Threshold probabilities for colourings of random hypergraphs

DOI10.4213/RM10222EMaRDI QIDQ6986422zbMATH OpenFDO

Authors Mikhail M. Koshelev, D. A. Shabanov, Taliya M. Shaikheeva

Publication date 12 May 2025

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

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

zbMATH Keywords

fractional colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• Catching the \(k\)-NAESAT threshold
• Fractional colourings of random hypergraphs
• Panchromatic colorings of random hypergraphs
• Sharp thresholds for constraint satisfaction problems and homomorphisms

This page was built for publication: Threshold probabilities for colourings of random hypergraphs

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