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.
- random graphs
- zero‐one laws
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics