Approximately counting Hamilton cycles in dense graphs

We describe a fully polynomial randomized approximation scheme for the problem of determining the number of Hamiltonian cycles in an n-vertex graph with minimum degree (i+~)n, for any fixed E > 0. We show that the exact counting problem is #P-complete. We also describe a fully polynomial randomized approximation scheme for counting cycles of all sizes in such graphs.

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

[2]  W. T. Tutte.  A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.

[3]  Janos Simon,et al.  On the Difference Between One and Many (Preliminary Version) , 1977, ICALP.

[4]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[5]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[6]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[8]  Martin E. Dyer,et al.  On the Complexity of Computing the Volume of a Polyhedron , 1988, SIAM J. Comput..

[9]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[10]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[11]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[12]  Mark Jerrum,et al.  Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..

[13]  G. Brightwell,et al.  Counting linear extensions , 1991 .

[14]  L. Khachiyan,et al.  On the conductance of order Markov chains , 1991 .

[15]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[16]  J. D. Annan,et al.  A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs , 1994, Combinatorics, Probability and Computing.

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