| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654982 | European Journal of Combinatorics | 2006 | 8 Pages |
Abstract
We characterize all the values of M=M(n)M=M(n) for which the random graph G(n,M)G(n,M) is a.a.s. projective.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tomasz Łuczak, Jaroslav Nešetřil,