Choosability in random hypergraphs
From MaRDI portal
Publication:1850565
DOI10.1006/jctb.2001.2053zbMath1023.05060OpenAlexW1978476471MaRDI QIDQ1850565
Michael Krivelevich, Van H. Vu
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a65d47d8e837844069d3970209fd4255693723c4
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items
On-line list colouring of random graphs, Random regular graphs of high degree, Colorings of partial Steiner systems and their applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List coloring of random and pseudo-random graphs
- An algorithmic approach to the Lovász local lemma. I
- On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
- The Choice Number of Dense Random Graphs
- On the Choice Number of Random Hypergraphs
- The chromatic number of random graphs
- The chromatic number of random graphs