Matchings and k-factors in a random graph. (English) Zbl 0494.05056
A random graph on n vertices has independent edge-occurrences with a common probability p that depends on n. Conditions are given for the almost sure existence of k-factors as \(n\to \infty\).
Reviewer: O.Frank
MSC:
05C99 | Graph theory |
60C05 | Combinatorial probability |
05C70 | Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) |