Abstract
The following result is proved: Let G n,p be a random graph with n vertices and probability p for an edge. If p is such that the random graph has min-degree at least r with probability 1, then any f-factor 1≦f≦r exists with probability 1, as n→∞.
| Original language | English |
|---|---|
| Pages (from-to) | 296-302 |
| Number of pages | 7 |
| Journal | Israel Journal of Mathematics |
| Volume | 39 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1981 |
Fingerprint
Dive into the research topics of 'On factors in random graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver