Estimating the strong \(r\)-colorability threshold in random hypergraphs

DOI10.2140/moscow.2023.12.57OpenAlexW4361285729MaRDI QIDQ2694278

Tatiana Matveeva, Alina E. Khuzieva, Dmitriy A. Shabanov

Publication date: 3 April 2023

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/moscow.2023.12.57

zbMATH Keywords

random hypergraphsprobability thresholdsstrong coloringssecond-moment method

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Upper-bounding the \(k\)-colorability threshold by counting covers
• On the chromatic number of random graphs
• 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 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
• The chromatic number of random graphs
• The two possible values of the chromatic number of a random graph

This page was built for publication: Estimating the strong \(r\)-colorability threshold in random hypergraphs