On panchromatic colourings of a random hypergraph

DOI10.1070/RM9831MaRDI QIDQ5377093zbMATH OpenOpenAlexWikidataFDO

Authors D. A. Kravtsov, N. E. Krokhmal, D. 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

panchromatic coloringprobability thresholdrandom hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Panchromatic colorings of random hypergraphs
• Panchromatic 3-colorings of random hypergraphs
• Panchromatic 3-coloring of a random hypergraph
• On the chromatic number of a random hypergraph
• Two‐coloring random hypergraphs

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
• The condensation transition in random hypergraph 2-coloring
• Two‐coloring random hypergraphs

Cited in

(8)

• Panchromatic 3-coloring of a random hypergraph
• Panchromatic colorings of random hypergraphs
• Chain method for panchromatic colorings of hypergraphs
• Estimating the r-colorability threshold for a random hypergraph
• Panchromatic 3-colorings of random hypergraphs
• On the \(s\)-colorful number of a random hypergraph
• On the structure of the set of panchromatic colorings of a random hypergraph
• Two values of the chromatic number of a sparse random graph

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

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