Packing, counting and covering Hamilton cycles in random directed graphs

A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of the main reasons for this is that there is no general tool for finding Hamilton cycles in directed graphs comparable to the so-called Posá ‘rotation-extension’ technique for the undirected analogue. Let D(n, p) denote the random digraph on vertex set [n], obtained by adding each directed edge independently with probability p. Here we present a general and a very simple method, using known results, to attack problems of packing and counting Hamilton cycles in random directed graphs, for every edge-probability p > logC(n)/n. Our results are asymptotically optimal with respect to all parameters and apply equally well to the undirected case.

[1]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[2]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[3]  E. Wright.  For how many edges is a digraph almost certainly Hamiltonian , 1973 .

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

[5]  L. Lovász.  Combinatorial problems and exercises , 1979 .

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

[7]  Timothy W. Tillson.  A Hamiltonian decomposition of K2m*, 2m >= 8 , 1980, J. Comb. Theory B.

[8]  D. Falikman.  Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix , 1981 .

[9]  G. Egorychev.  The solution of van der Waerden's problem for permanents , 1981 .

[10]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[11]  Béla Bollobás,et al.  Random Graphs , 1985 .

[12]  Carsten Thomassen,et al.  Hamilton Circuits in Regular Tournaments , 1985 .

[13]  Alan M. Frieze.  An Algorithm for Finding Hamilton Cycles in Random Directed Graphs , 1988, J. Algorithms.

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

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

[16]  Alan M. Frieze,et al.  Counting the Number of Hamilton Cycles in Random Digraphs , 1992, Random Struct. Algorithms.

[17]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[18]  Svante Janson,et al.  The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph , 1994, Combinatorics, Probability and Computing.

[19]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[20]  Timothy W. Tillson,et al.  A Hamiltonian Decomposition of K & , 2 m > 8 , 2003 .

[21]  Endre Szemerédi,et al.  On the number of Hamiltonian cycles in Dirac graphs , 2003, Discret. Math..

[22]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[23]  Bill Cuckler,et al.  Hamiltonian Cycles in Regular Tournaments , 2007, Combinatorics, Probability and Computing.

[24]  N. Alon,et al.  The Probabilistic Method: Alon/Probabilistic , 2008 .

[25]  Michael Krivelevich,et al.  On two Hamilton cycle problems in random graphs , 2008 .

[26]  Bill Cuckler,et al.  Hamiltonian cycles in Dirac graphs , 2009, Comb..

[27]  Benny Sudakov,et al.  On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs , 2011, SIAM J. Discret. Math..

[28]  Wojciech Samotij,et al.  Optimal Packings of Hamilton Cycles in Sparse Random Graphs , 2011, SIAM J. Discret. Math..

[29]  Michael Krivelevich.  On the Number of Hamilton Cycles in Pseudo-Random Graphs , 2012, Electron. J. Comb..

[30]  Daniela Kühn,et al.  Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments , 2012, ArXiv.

[31]  Michael Krivelevich,et al.  On the Number of Hamilton Cycles in Sparse Random Graphs , 2013, SIAM J. Discret. Math..

[32]  Asaf Ferber,et al.  Packing a randomly edge-colored random graph with rainbow $k$-outs , 2014, 1410.1803.

[33]  Daniela Kühn,et al.  Hamilton decompositions of regular expanders: Applications , 2012, J. Comb. Theory, Ser. B.

[34]  Daniela Kühn,et al.  Optimal covers with Hamilton cycles in random graphs , 2014, Comb..

[35]  Michael Krivelevich,et al.  On covering expander graphs by hamilton cycles , 2011, Random Struct. Algorithms.

[36]  D. Kuhn,et al.  Proof of the 1-factorization and Hamilton Decomposition Conjectures , 2014, 1401.4183.

[37]  Daniela Kühn,et al.  Edge‐disjoint Hamilton cycles in random graphs , 2011, Random Struct. Algorithms.

[38]  Ueli Peter,et al.  Robust hamiltonicity of random directed graphs extended abstract , 2015, SODA.

[39]  Benny Sudakov,et al.  Random directed graphs are robustly Hamiltonian , 2014, Random Struct. Algorithms.

[40]  Ueli Peter,et al.  Robust Hamiltonicity of random directed graphs , 2014, J. Comb. Theory, Ser. B.

[41]  Benny Sudakov,et al.  Counting and packing Hamilton cycles in dense graphs and oriented graphs , 2012, J. Comb. Theory, Ser. B.