Hamiltonian Cycles on a Random Three-coordinate Lattice

Abstract

Consider a random three-coordinate lattice of spherical topology having 2v vertices and being densely covered by a single closed, self-avoiding walk, i.e. being equipped with a Hamiltonian cycle. We determine the number of such objects as a function of v. Furthermore we express the partition function of the corresponding statistical model as an elliptic integral.

10 pages, LaTeX, 3 eps-figures, one reference added

References in corpus (3)

• An Iterative Solution of the Three-colour Problem on a Random Lattice
• Coloring Random Triangulations
• Field theoretic approach to the counting problem of Hamiltonian cycles of graphs

Cited by in corpus (6)

• Generalized Lorentzian Triangulations and the Calogero Hamiltonian
• Rotational Symmetry Breaking in Multi-Matrix Models
• Geometrically constrained statistical systems on regular and random lattices: From folding to meanders
• Fully Packed O(n=1) Model on Random Eulerian Triangulations
• Hamiltonian Cycles on Random Eulerian Triangulations
• Spanning Forests on Random Planar Lattices