The harmonious labelling conjecture
The harmonious labelling conjecture
Let be a tree with edges, and let denote the cyclic group of order . A labelling is a map ; edge sums are the values for .
The harmonious labelling conjecture. For every -edge tree , there exists a labelling such that the edge sums are all distinct, and exactly one label is used on two vertices.
This is the cyclic additive labelling conjecture of Graham and Sloane. The paper states that it is confirmed for bounded-degree trees, but the unrestricted conjecture remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Alp Müyesser and Alexey Pokrovskiy, “On the Graham–Sloane harmonious labelling conjecture”, arXiv:2509.05280 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.