On factors in random graphs
ISRAEL JOURNAL OF MATHEMATICS, Vol, 39, No. 4, 1981
ON FACTORS IN RANDOM GRAPHS
BY
E. SHAMIR AND E. UPFAL
ABSTRACT
The following result is proved: Let G,.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 l, then any f-factor I _-
ON FACTORS IN RANDOM GRAPHS
BY
E. SHAMIR AND E. UPFAL
ABSTRACT
The following result is proved: Let G,.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 l, then any f-factor I _-
