Graceful Tree Conjecture

The problem is:

Is every tree graceful?

A graceful labeling of a graph with n vertices and e edges is a labeling of its vertices with distinct integers between 0 and e inclusive, such that each edge is uniquely identified by the positive, or absolute difference between its endpoints.

Last update: 18 May 2010