On the Choice Number of Random Hypergraphs

DOI10.1017/S0963548399004095zbMath0944.05048OpenAlexW2089062694MaRDI QIDQ4948047

Van H. Vu

Publication date: 24 September 2000

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548399004095

zbMATH Keywords

chromatic numberrandom hypergraphchoice number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Concentration of non‐Lipschitz functions and applications ⋮ Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝) ⋮ Choosability in random hypergraphs