论文信息 - Countable Sparse Random Graphs

Countable Sparse Random Graphs

For each irrational a, 0<a<1, a particular countable graph G is defined which mirrors the asymptotic behavior of the random graph G(n, p) with edge probability p = n−a.

Joel H. Spencer

[1] Andrzej Rucinski,et al. Strongly balanced graphs and random graphs , 1986, J. Graph Theory.

[2] J. Spencer,et al. Zero-one laws for sparse random graphs , 1988 .