Citation Context

.... Later on, Frieze and Loh [11] improved this to p = logn+log logn+ω(1) n and c = (1 + o(1))n, which is asymptotically optimal with respect to both of the parameters p and c. Recently, Bal and Frieze =-=[2]-=- obtained the optimal c by showing that for p = ω(log n/n) and c = n/2 (respectively c = n), a typical graph H ∼ Gc(n, p) contains a rainbow perfect matching (respectively a rainbow Hamilton cycle). F...