On the strong chromatic number of a random 3-uniform hypergraph

DOI10.1016/j.disc.2020.112231zbMath1456.05053OpenAlexW3109200289MaRDI QIDQ2222935

Arseniy E. Balobanov, Dmitriy A. Shabanov

Publication date: 27 January 2021

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112231

zbMATH Keywords

random hypergraphssecond moment methodstrong colorings

Mathematics Subject Classification ID

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

Related Items

On the maximal cut in a random hypergraph ⋮ On the strong chromatic number of random hypergraphs ⋮ On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ Bounds on threshold probabilities for coloring properties of random hypergraphs ⋮ Estimating the strong \(r\)-colorability threshold in random hypergraphs

Cites Work

• 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
• A note on the sharp concentration of the chromatic number of random graphs
• Estimating the \(r\)-colorability threshold for a random 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
• The chromatic number of random graphs
• The chromatic number of random graphs
• The two possible values of the chromatic number of a random graph