Counting Hamiltonian cycles on planar random lattices
Saburo Higuchi
Abstract
A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. In this article, Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles is obtained and its singularity is studied. Relation to two-dimensional quantum gravity is discussed.
Create a lesson
Related papers
Global Minima of the Thomson Problem in a Disk: A Molecular Dynamics Approach with Fixed Border Charges
Georgiy K. Lavrov, Eduard G. Nikonov
Martingale theory for heat and phase-space contraction in heterogeneous diffusions
Jing Qin, Nariya Uchida, Édgar Roldán
Formal Fluctuation-Response Relations for Non-Stationary Systems: The Dynamic Conjugate Variable
Igor M. Sokolov
Khinchin's ergodicity and typicality in statistical mechanics
Dario Lucente, Marco Baldovin, Giacomo Gradenigo et al.
Universal 1/f Noise in the Power Spectra of Energy Time-series in Solvated DNA Dynamics
Harsh Sahu, Deepika Sardana, Pramod Kumar et al.
Landau diamagnetism and the de Haas-van Alphen effect from a single geometric construction
Sung-Hoon Lee