The Choice Number of Dense Random Graphs

  • Authors:

  • Michael Krivelevich

  • Affiliations:

  • School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540, USA (e-mail: mkrivel@math.ias.edu)

  • Venue:
  • Combinatorics, Probability and Computing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove that if the edge probability p(n) satisfies n−1/4+ε ≤ p(n) ≤ 3/4, where 0 G(n, p) are almost surely asymptotically equal.