On Two Limit Values of the Chromatic Number of a Random Hypergraph
From MaRDI portal
Publication:5097170
DOI10.1137/S0040585X97T990861zbMath1495.05313WikidataQ114073919 ScholiaQ114073919MaRDI QIDQ5097170
Dmitriy A. Shabanov, Yury A. Demidovich
Publication date: 22 August 2022
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper-bounding the \(k\)-colorability threshold by counting covers
- Random Kneser graphs and hypergraphs
- On the chromatic number of random graphs
- The \(t\)-stability number of a random graph
- A note on the chromatic number of a dense random graph
- 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
- Estimating the \(r\)-colorability threshold for a random hypergraph
- On the strong chromatic number of a random 3-uniform hypergraph
- On the weak chromatic number 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
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Introduction to Random Graphs
- Random hypergraph coloring algorithms and the weak chromatic number
- The Chromatic Number of Random Graphs for Most Average Degrees
- The chromatic number of dense random graphs
- Hypergraph coloring up to condensation
- Two-Colorings of a Random Hypergraph
- The chromatic number of random graphs
- The two possible values of the chromatic number of a random graph
- On the chromatic number of random graphs
This page was built for publication: On Two Limit Values of the Chromatic Number of a Random Hypergraph
