Panchromatic 3-coloring of a random hypergraph

DOI10.1016/j.endm.2017.07.036zbMath1378.05063OpenAlexW2744636876MaRDI QIDQ1690010

Dmitry Kravtsov, Nikolay Krokhmal, Dmitriy A. Shabanov

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.036

zbMATH Keywords

random hypergraphsecond moment methodpanchromatic colorings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
• On the chromatic number of a random hypergraph
• On a generalization of Rubin's theorem
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• Two‐coloring random hypergraphs

This page was built for publication: Panchromatic 3-coloring of a random hypergraph