Panchromatic 3-coloring of a random hypergraph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- On a generalization of Rubin's theorem
- On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
- 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
Cited in
(6)- Panchromatic colorings of random hypergraphs
- On the structure of the set of panchromatic colorings of a random hypergraph
- Panchromatic 3-colorings of random hypergraphs
- On the strong chromatic number of a random 3-uniform hypergraph
- On panchromatic colourings of a random hypergraph
- Estimating the strong \(r\)-colorability threshold in random hypergraphs
This page was built for publication: Panchromatic 3-coloring of a random hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690010)