On the strong chromatic number of random hypergraphs

DOI10.1134/S1064562422010094zbMath1491.05172MaRDI QIDQ2145753

T. G. Matveeva, Alina E. Khuzieva, Dmitriy A. Shabanov

Publication date: 20 June 2022

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

zbMATH Keywords

colorings of hypergraphsrandom hypergraphsecond moment methodstrong chromatic numberprobability thresholds

Mathematics Subject Classification ID

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

Related Items (1)

On the concentration of values of \(j\)-chromatic numbers of random hypergraphs

Cites Work

• Unnamed Item
• Upper-bounding the \(k\)-colorability threshold by counting covers
• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• Estimating the \(r\)-colorability threshold for a random hypergraph
• On the strong chromatic number of a random 3-uniform hypergraph
• On the weak chromatic number of random hypergraphs
• On the chromatic number of a random hypergraph
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• The Chromatic Number of Random Graphs for Most Average Degrees
• Hypergraph coloring up to condensation
• Two-Colorings of a Random Hypergraph
• 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 strong chromatic number of random hypergraphs