On the Choice Number of Random Hypergraphs

DOI10.1017/S0963548399004095MaRDI QIDQ4948047zbMATH OpenOpenAlexFDO

Authors Van 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

choice numberchromatic numberrandom hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Choosability in random hypergraphs
• List coloring of random and pseudo-random graphs
• On the chromatic number of a random hypergraph
• The Choice Number of Dense Random Graphs

Cited in

(6)

• Choosability in random hypergraphs
• List coloring of random and pseudo-random graphs
• Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
• Concentration of non‐Lipschitz functions and applications
• The Choice Number of Dense Random Graphs
• Union-free hypergraphs and probability theory

This page was built for publication: On the Choice Number of Random Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948047)