Panchromatic colorings of random hypergraphs
From MaRDI portal
Publication:1996843
DOI10.1515/dma-2021-0003zbMath1459.05304OpenAlexW3132955876MaRDI QIDQ1996843
N. E. Krokhmal, D. A. Kravtsov, Dmitriy A. Shabanov
Publication date: 26 February 2021
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2021-0003
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)
Related Items (4)
On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ On the structure of the set of panchromatic colorings of a random hypergraph ⋮ On the chromatic numbers of random hypergraphs
Cites Work
- Unnamed Item
- On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
- A note on panchromatic colorings
- On the chromatic number of a random hypergraph
- On the concentration of the chromatic number of a random hypergraph
- Panchromatic 3-colorings of random hypergraphs
- On a generalization of Rubin's theorem
- Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
- The existence of panchromatic colourings for uniform hypergraphs
- 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: Panchromatic colorings of random hypergraphs