On the concentration of the chromatic number of a random hypergraph

DOI10.1134/S1064562417040044zbMath1373.05069OpenAlexW2753788044MaRDI QIDQ2411788

Dmitriy A. Shabanov

Publication date: 25 October 2017

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562417040044

zbMATH Keywords

random uniform hypergraph

Mathematics Subject Classification ID

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

Related Items (8)

On the \(s\)-colorful number of a random hypergraph ⋮ On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ Panchromatic 3-colorings of random hypergraphs ⋮ Two-Colorings of a Random Hypergraph ⋮ On the chromatic numbers of random hypergraphs ⋮ Panchromatic colorings of random hypergraphs ⋮ Equitable colorings of hypergraphs with few edges ⋮ On the weak chromatic number of random hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the sharp concentration of the chromatic number of random graphs
• On the chromatic number of a random hypergraph
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• The Chromatic Number of Random Graphs for Most Average Degrees
• 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: On the concentration of the chromatic number of a random hypergraph