Two-Colorings of a Random Hypergraph

DOI10.1137/S0040585X97T989398zbMath1481.05053OpenAlexW2943309949MaRDI QIDQ5380531

No author found.

Publication date: 5 June 2019

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0040585x97t989398

zbMATH Keywords

hypergraph\(j\)-chromatic numbercolorings of a hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

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, Estimating the \(r\)-colorability threshold for a random hypergraph, 2-colorings of hypergraphs with large girth, Bounds on threshold probabilities for coloring properties of random hypergraphs, On the concentration of the independence numbers of random hypergraphs, On the chromatic numbers of random hypergraphs, New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

Cites Work

• Unnamed Item
• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• On the concentration of the chromatic number of a random hypergraph
• Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• Random hypergraph coloring algorithms and the weak chromatic number
• Two‐coloring random hypergraphs
• The condensation transition in random hypergraph 2-coloring