论文信息 - Partitioning random graphs into large cycles

Partitioning random graphs into large cycles

Abstract Let r ⩾ 1 be a fixed positive integer. We give the limiting distribution for the probability that the vertices of a random graph can be partitioned equitably into r cycles.

Alan M. Frieze | A. Frieze

[1] T.I. Fenner,et al. On the existence of Hamiltonian cycles in a class of random graphs , 1983, Discret. Math..

[2] L. Pósa,et al. Hamiltonian circuits in random graphs , 1976, Discret. Math..

[3] A. Frieze. ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS , 1988 .

[4] P. Erdos,et al. On the strength of connectedness of a random graph , 1964 .

[5] Tomasz Luczak,et al. On k-leaf connectivity of a random graph , 1988, J. Graph Theory.

[6] Alan M. Frieze,et al. An algorithm for finding Hamilton cycles in random graphs , 1985, STOC '85.

[7] János Komlós,et al. Limit distribution for the existence of hamiltonian cycles in a random graph , 1983, Discret. Math..

[8] C. McDiarmid. Clutter percolation and random graphs , 1980 .

[9] Alan M. Frieze. On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients , 1987, SIAM J. Comput..

[10] Béla Bollobás,et al. Almost all Regular Graphs are Hamiltonian , 1983, European journal of combinatorics (Print).

[11] Alan M. Frieze. On large matchings and cycles in sparse random graphs , 1986, Discret. Math..

[12] Alan M. Frieze,et al. Finding hamilton cycles in sparse random graphs , 1987, J. Comb. Theory, Ser. B.

[13] Alan M. Frieze,et al. Hamiltonian cycles in random regular graphs , 1984, J. Comb. Theory, Ser. B.