Abstract
When p = c/n and c goes from less than one to greater than one, the random graph G(n, p) experiences the double jump. The first order language is too weak to recognize this change while there are properties expressable in the second order monadic language for which the change is clear. © 1994 John Wiley & Sons, Inc.
| Original language | English |
|---|---|
| Pages (from-to) | 191-204 |
| Number of pages | 14 |
| Journal | Random Structures and Algorithms |
| Volume | 5 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1994 |
Fingerprint
Dive into the research topics of 'Can you feel the double jump?'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver