On two limit values of the chromatic number of a random hypergraph

DOI10.1137/S0040585X97T990861MaRDI QIDQ5097170zbMATH OpenWikidataFDO

Authors Yury A. Demidovich, D. A. Shabanov

Publication date 22 August 2022

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

zbMATH Keywords

chromatic numberrandom hypergraphsecond moment method

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

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

Cites work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1380583 (Why is no real title available?)
• A note on the chromatic number of a dense random graph
• A note on the sharp concentration of the chromatic number of random graphs
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Estimating the \(r\)-colorability threshold for a random hypergraph
• Hypergraph coloring up to condensation
• Introduction to Random Graphs
• On the chromatic number of a random hypergraph
• On the chromatic number of random graphs
• On the chromatic number of random graphs
• On the concentration of the chromatic number of a random hypergraph
• On the strong chromatic number of a random 3-uniform hypergraph
• On the weak chromatic number of random hypergraphs
• Panchromatic 3-colorings of random hypergraphs
• Panchromatic colorings of random hypergraphs
• Random Kneser graphs and hypergraphs
• Random graphs.
• Random hypergraph coloring algorithms and the weak chromatic number
• The \(t\)-stability number of a random graph
• The chromatic number of dense random graphs
• The chromatic number of random graphs
• The chromatic number of random graphs for most average degrees
• The concentration of the chromatic number of random graphs
• The two possible values of the chromatic number of a random graph
• Two-colorings of a random hypergraph
• Upper-bounding the k-colorability threshold by counting covers

Cited in

(3)

• The two possible values of the chromatic number of a random graph
• On the chromatic numbers of random hypergraphs
• On the concentration of values of \(j\)-chromatic numbers of random hypergraphs

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)