Random hypergraphs and property B
From MaRDI portal
Publication:2225409
DOI10.1016/j.ejc.2020.103205zbMath1458.05237arXiv2102.12968MaRDI QIDQ2225409
Jakub Kozik, Lech Duraj, Dmitriy A. Shabanov
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.12968
05C80: Random graphs (graph-theoretic aspects)
05C65: Hypergraphs
05C15: Coloring of graphs and hypergraphs
68W20: Randomized algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Random \(k\)-SAT: A tight threshold for moderately growing \(k\)
- Panchromatic 3-colorings of random hypergraphs
- On the 2-colorability of random hypergraphs
- Two‐coloring random hypergraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- A Better Algorithm for Random k-SAT
- Catching the k-NAESAT threshold
- On a combinatorial problem. II
- The condensation transition in random hypergraph 2-coloring