论文信息 - Hamilton cycles in 3-out

Hamilton cycles in 3-out

Let G3-out denote the random graph on vertex set [n] in which each vertex chooses three neighbors uniformly at random. Note that G3-out has minimum degree 3 and average degree 6. We prove that the probability that G3-out is Hamiltonian goes to 1 as n tends to infinity. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009

Tom Bohman | Alan Frieze | A. Frieze | T. Bohman

[1] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .

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

[3] Colin Cooper,et al. Hamilton cycles in random graphs and directed graphs , 2000 .

[4] Nicholas C. Wormald,et al. Almost All Regular Graphs Are Hamiltonian , 1994, Random Struct. Algorithms.

[5] Alan M. Frieze,et al. Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity , 2002, Combinatorics, Probability and Computing.

[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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

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

[9] A. Frieze,et al. On the connectivity of randomm-orientable graphs and digraphs , 1982 .

[10] Béla Bollobás,et al. On matchings and hamiltonian cycles in random graphs Annals of Discrete Mathematics 28 , 1985 .

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

[12] Benny Sudakov,et al. Random regular graphs of high degree , 2001, Random Struct. Algorithms.

[13] B. Bollobás,et al. An algorithm for finding hamilton paths and cycles in random graphs , 1987 .