On factors in random graphs

E. Shamir*, E. Upfal

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

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 languageEnglish
Pages (from-to)296-302
Number of pages7
JournalIsrael Journal of Mathematics
Volume39
Issue number4
DOIs
StatePublished - Dec 1981

Fingerprint

Dive into the research topics of 'On factors in random graphs'. Together they form a unique fingerprint.

Cite this