On the chromatic numbers of random hypergraphs
From MaRDI portal
Publication:2243791
DOI10.1134/S1064562420050312zbMath1478.05134OpenAlexW3118634717MaRDI QIDQ2243791
Yury A. Demidovich, Dmitriy A. Shabanov
Publication date: 11 November 2021
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562420050312
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Upper-bounding the \(k\)-colorability threshold by counting covers
- Random Kneser graphs and hypergraphs
- On the chromatic number of random graphs
- A note on the sharp concentration of the chromatic number of random graphs
- The concentration of the chromatic number of random graphs
- Panchromatic colorings of random hypergraphs
- 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
- The Chromatic Number of Random Graphs for Most Average Degrees
- Hypergraph coloring up to condensation
- Two-Colorings of a Random Hypergraph
- The two possible values of the chromatic number of a random graph
This page was built for publication: On the chromatic numbers of random hypergraphs