Hamilton cycles in the union of random permutations

We prove that with high probability, two random permutations contain an undirected Hamilton cycle and three random permutations almost always contain a directed Hamilton cycle. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18, 83–94, 2001

[1]  Alan M. Frieze,et al.  When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? , 1992, IPCO.

[2]  Brendan D. McKay,et al.  Asymptotic Enumeration by Degree Sequence of Graphs of High Degree , 1990, Eur. J. Comb..

[3]  R. C. Read,et al.  The Enumeration of Locally Restricted Graphs (I) , 1959 .

[4]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

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

[6]  Nicholas C. Wormald,et al.  Almost All Cubic Graphs Are Hamiltonian , 1992, Random Struct. Algorithms.

[7]  Alan M. Frieze,et al.  Generating and Counting Hamilton Cycles in Random Regular Graphs , 1996, J. Algorithms.

[8]  N. Wormald,et al.  Models of the , 2010 .

[9]  Alan M. Frieze,et al.  Hamilton Cycles in a Class of Random Directed Graphs , 1994, J. Comb. Theory, Ser. B.

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

[11]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

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

[13]  Brendan D. McKay,et al.  Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..

[14]  Alan M. Frieze,et al.  Hamilton Cycles in Random Regular Digraphs , 1994, Combinatorics, Probability and Computing.

[15]  Svante Janson,et al.  Random Regular Graphs: Asymptotic Distributions and Contiguity , 1995, Combinatorics, Probability and Computing.

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

[17]  Hanna D. Robalewska,et al.  1-Factorizations of random regular graphs , 1997, Random Struct. Algorithms.

[18]  Andrei Z. Broder,et al.  On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[19]  Colin Cooper.  The union of two random permutations does not have a directed Hamilton cycle , 2001, Random Struct. Algorithms.