Two‐coloring random hypergraphs
From MaRDI portal
Publication:4543631
DOI10.1002/rsa.997zbMath1001.05059OpenAlexW251413274MaRDI QIDQ4543631
Jeong Han Kim, Michael Krivelevich, Demetrios Achlioptas, Prasad Tetali
Publication date: 8 August 2002
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.997
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (17)
Waiter-client and client-waiter colourability and \(k\)-SAT games ⋮ On the concentration of the number of solutions of random satisfiability formulas ⋮ On the number of solutions in random hypergraph 2-colouring ⋮ Estimating the \(r\)-colorability threshold for a random hypergraph ⋮ Panchromatic 3-coloring of a random hypergraph ⋮ Panchromatic 3-colorings of random hypergraphs ⋮ On the structure of the set of panchromatic colorings of a random hypergraph ⋮ Bounds on threshold probabilities for coloring properties of random hypergraphs ⋮ Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem ⋮ On panchromatic colourings of a random hypergraph ⋮ Two-Colorings of a Random Hypergraph ⋮ Random hypergraphs and property B ⋮ Panchromatic colorings of random hypergraphs ⋮ Lower bounds for random 3-SAT via differential equations ⋮ Colorings of partial Steiner systems and their applications ⋮ The condensation transition in random hypergraph 2-coloring ⋮ On the chromatic number of a random hypergraph
Cites Work
This page was built for publication: Two‐coloring random hypergraphs
