no. 16 · Tuesday 17 November 2026
The maximum length of a Hamiltonian path in the grid graph $P_m \times P_n$
Abstract
Label the $mn$ vertices of the grid graph $P_m \times P_n$ bijectively by $1, \dots, mn$ and read the labels in increasing order; this produces a Hamiltonian path whose length in the Manhattan metric is denoted $M(P_m \times P_n)$. McNeil conjectured, on the basis of computer evidence, that $M(P_n \times P_n) = n^3 - 3$ for even $n$ and $n^3 - n - 1$ for odd $n$. Fried recently determined $M(P_m \times P_n)$ up to an additive error of one. We determine it exactly, which settles McNeil's conjecture. The proof rests on the cut-counting bound for multisets. Fried states that bound for multiplicities at least two; we give a form valid for every multiplicity, with a correction term that is invisible in the planar case but not in higher dimensions.
- comments
- 11 pages
- fields
- Combinatorics