English

On the Graham--Sloane harmonious labelling conjecture

Combinatorics 2025-10-07 v2 Group Theory

Abstract

Consider an order nn abelian group GG and a tree TT on nn vertices. When is it possible to (bijectively) label V(T)V(T) by GG so that along all edges xyxy of TT, the sums x+yx+y are distinct? This problem can be traced back to the work of Graham and Sloane on the harmonious labelling conjecture, and has been studied extensively since its introduction in 1980. We give a precise characterisation that holds for all bounded degree trees. In particular, our characterisation implies that if G=Z/nZG=\mathbb{Z}/n\mathbb{Z} and TT is a bounded degree tree, the desired labelling exists. This confirms a conjecture of Graham and Sloane from 1980, and another conjecture of Chang, Hsu, and Rogers from 1987, for bounded degree trees. Our results also have further applications for the study of graph coverings.

Keywords

Cite

@article{arxiv.2509.05280,
  title  = {On the Graham--Sloane harmonious labelling conjecture},
  author = {Alp Müyesser and Alexey Pokrovskiy},
  journal= {arXiv preprint arXiv:2509.05280},
  year   = {2025}
}

Comments

Improves exposition, corrects a previous mis-citation of the Chang--Hsu--Rogers conjecture, introduces a new example that contradicts a conjecture of the authors from the previous version of the article

R2 v1 2026-07-01T05:23:30.445Z