English

Counting Hamiltonian cycles in planar triangulations

Combinatorics 2021-11-23 v2

Abstract

Hakimi, Schmeichel, and Thomassen in 1979 conjectured that every 44-connected planar triangulation GG on nn vertices has at least 2(n2)(n4)2(n-2)(n-4) Hamiltonian cycles, with equality if and only if GG is a double wheel. In this paper, we show that every 44-connected planar triangulation on nn vertices has Ω(n2)\Omega(n^2) Hamiltonian cycles. Moreover, we show that if GG is a 44-connected planar triangulation on nn vertices and the distance between any two vertices of degree 44 in GG is at least 33, then GG has 2Ω(n1/4)2^{\Omega(n^{1/4})} Hamiltonian cycles.

Keywords

Cite

@article{arxiv.2105.07551,
  title  = {Counting Hamiltonian cycles in planar triangulations},
  author = {Xiaonan Liu and Zhiyu Wang and Xingxing Yu},
  journal= {arXiv preprint arXiv:2105.07551},
  year   = {2021}
}

Comments

arXiv admin note: text overlap with arXiv:2104.04898

R2 v1 2026-06-24T02:09:43.476Z