ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T=(V,E)T=(V,E) be a finite tree with m=∣E∣m=|E| edges. Call a map

f:V⟶{0,1,…,m}f:V\longrightarrow\{0,1,\dots,m\}

a graceful labeling of TT if ff is injective and the induced edge labels realize every value in {1,2,…,m}\{1,2,\dots,m\}, i.e.

{ ∣f(u)−f(v)∣  :  uv∈E }={1,2,…,m}.\bigl\{\,|f(u)-f(v)| \;:\; uv\in E\,\bigr\}=\{1,2,\dots,m\}.

(Since ∣E∣=m|E|=m and the set on the left has mm elements, this condition says exactly that the mm edge differences are pairwise distinct and all lie in {1,…,m}\{1,\dots,m\}.) A graph admitting such a labeling is called graceful.

Every finite tree admits a graceful labeling.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.