On panchromatic colourings of a random hypergraph

DOI10.1070/RM9831zbMath1437.05076OpenAlexW2890963812WikidataQ129299968 ScholiaQ129299968MaRDI QIDQ5377093

N. E. Krokhmal, D. A. Kravtsov, Dmitriy A. Shabanov

Publication date: 23 May 2019

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

Full work available at URL: https://doi.org/10.1070/rm9831

zbMATH Keywords

random hypergraphpanchromatic coloringprobability threshold

Mathematics Subject Classification ID

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

Related Items (1)

Estimating the \(r\)-colorability threshold for a random hypergraph

Cites Work

• On the chromatic number of a random hypergraph
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• Two‐coloring random hypergraphs
• The condensation transition in random hypergraph 2-coloring

This page was built for publication: On panchromatic colourings of a random hypergraph