graceful tree conjecture
Statement
Let be a finite tree with edges. Call a map
a graceful labeling of if is injective and the induced edge labels realize every value in , i.e.
(Since and the set on the left has elements, this condition says exactly that the edge differences are pairwise distinct and all lie in .) A graph admitting such a labeling is called graceful.
Every finite tree admits a graceful labeling.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.