On the 2-colorability of random hypergraphs
From MaRDI portal
Publication:4440429
zbMath1030.05084arXiv2011.04809MaRDI QIDQ4440429
Moore, Cristopher, Demetrios Achlioptas
Publication date: 17 December 2003
Full work available at URL: https://arxiv.org/abs/2011.04809
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20)
Related Items
A sharp threshold for a random constraint satisfaction problem, Waiter-client and client-waiter colourability and \(k\)-SAT games, A positive temperature phase transition in random hypergraph 2-coloring, Information-theoretic thresholds from the cavity method, Estimating the \(r\)-colorability threshold for a random hypergraph, Bounds on threshold probabilities for coloring properties of random hypergraphs, Random hypergraphs and property B, Charting the replica symmetric phase, Hunting for sharp thresholds, Colorings of partial Steiner systems and their applications, Phase Transitions in Discrete Structures, An average study of hypergraphs and their minimal transversals
