Partitioning random graphs into large cycles (Q1104340)

Let G be a graph chosen randomly from the set of graphs with \(m=m(n)\) edges on n vertices. For any fixed integer r, the probability that G can be partitioned equitably into r cycles is given for \(n\to \infty\).