Two values of the chromatic number of a sparse random graph

MaRDI QIDQ6621228

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

Could not fetch data.

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Upper-bounding the \(k\)-colorability threshold by counting covers
• Random Kneser graphs and hypergraphs
• On the chromatic number of a random subgraph of the Kneser graph
• 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
• A note on panchromatic colorings
• On the weak chromatic number of random hypergraphs
• 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
• The chromatic number of dense random graphs
• On panchromatic colourings of a random hypergraph
• The chromatic number of random graphs
• The chromatic number of random graphs
• The two possible values of the chromatic number of a 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)