Two values of the chromatic number of a sparse random graph

MaRDI QIDQ6621228zbMATH OpenFDO

Authors S. Kargaltsev, D. A. Shabanov, T. Shaikheeva

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

zbMATH Keywords

random graphscoloringssecond moment method

Mathematics Subject Classification ID

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

Recommendations

• The concentration of the chromatic number of random graphs
• On the concentration of the chromatic number of random graphs
• How Sharp is the Concentration of the Chromatic Number?
• scientific article; zbMATH DE number 3895112
• On the Chromatic Number of Random Graphs

Cites work

• scientific article; zbMATH DE number 1380613 (Why is no real title available?)
• A note on panchromatic colorings
• A note on the sharp concentration of the chromatic number of random graphs
• On panchromatic colourings of a random hypergraph
• On the chromatic number of a random subgraph of the Kneser graph
• On the chromatic number of random graphs
• On the concentration of the chromatic number of a random hypergraph
• On the weak chromatic number of random hypergraphs
• Panchromatic 3-colorings of random hypergraphs
• Random Kneser graphs and hypergraphs
• The chromatic number of dense random graphs
• The chromatic number of 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
• Upper-bounding the k-colorability threshold by counting covers

Cited in

(1)

• Two-Point Concentration of the Independence Number of the Random Graph

This page was built for publication: Two values of the chromatic number of a sparse random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621228)