On two limit values of the chromatic number of a random hypergraph
From MaRDI portal
Publication:5097170
DOI10.1137/S0040585X97T990861zbMATH Open1495.05313WikidataQ114073919 ScholiaQ114073919MaRDI QIDQ5097170FDOQ5097170
Authors: Yury A. Demidovich, D. A. Shabanov
Publication date: 22 August 2022
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Recommendations
- On the concentration of values of \(j\)-chromatic numbers of random hypergraphs
- On the chromatic numbers of random hypergraphs
- On the concentration of the chromatic number of a random hypergraph
- The two possible values of the chromatic number of a random graph
- On the chromatic number of a random hypergraph
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Random graphs.
- The two possible values of the chromatic number of a random graph
- The chromatic number of random graphs
- The concentration of the chromatic number of random graphs
- On the chromatic number of random graphs
- Introduction to Random Graphs
- A note on the sharp concentration of the chromatic number of random graphs
- Upper-bounding the \(k\)-colorability threshold by counting covers
- On the chromatic number of random graphs
- The chromatic number of dense random graphs
- The \(t\)-stability number of a random graph
- On the chromatic number of a random hypergraph
- Estimating the \(r\)-colorability threshold for a random hypergraph
- Title not available (Why is that?)
- Random Kneser graphs and hypergraphs
- The chromatic number of random graphs for most average degrees
- Hypergraph coloring up to condensation
- A note on the chromatic number of a dense random graph
- Random hypergraph coloring algorithms and the weak chromatic number
- On the concentration of the chromatic number of a random hypergraph
- Panchromatic colorings of random hypergraphs
- Panchromatic 3-colorings of random hypergraphs
- On the weak chromatic number of random hypergraphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Two-colorings of a random hypergraph
- On the strong chromatic number of a random 3-uniform hypergraph
Cited In (3)
This page was built for publication: On two limit values of the chromatic number of a random hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097170)