Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 205-214 |
| Number of pages | 10 |
| Journal | Random Structures & Algorithms |
| Volume | 1 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1990 |
Keywords
- random graphs
- zero‐one laws
ASJC Scopus subject areas
- Software
- General Mathematics
- Computer Graphics and Computer-Aided Design
- Applied Mathematics