Field theoretic approach to the counting problem of Hamiltonian cycles of graphs

Abstract

A Hamiltonian cycle of a graph is a closed path that visits each site once and only once. I study a field theoretic representation for the number of Hamiltonian cycles for arbitrary graphs. By integrating out quadratic fluctuations around the saddle point, one obtains an estimate for the number which reflects characteristics of graphs well. The accuracy of the estimate is verified by applying it to 2d square lattices with various boundary conditions. This is the first example of extracting meaningful information from the quadratic approximation to the field theory representation.

5 pages, 3 figures, uses epsf.sty. Estimates for the site entropy and the gamma exponent indicated explicitly

Cited by in corpus (9)

• Field theory of compact polymers on the square lattice
• Relaxation in graph coloring and satisfiability problems
• Hamiltonian Cycles on a Random Three-coordinate Lattice
• Hamiltonian walks on Sierpinski and n-simplex fractals
• Phase behaviour of semiflexible lattice polymers in poor-solvent solution: mean-field theory and Monte Carlo simulations
• Compact polymers on decorated square lattices
• Hamiltonian Cycles on Ammann-Beenker Tilings
• Loop Model with Generalized Fugacity in Three Dimensions
• Entropy of self-avoiding branching polymers: mean field theory and Monte Carlo simulations