Hartsfield's antimagic conjecture for trees

About 5 years old · traced to

Let TT be a tree. An antimagic labeling of TT is a bijection f:E(T)→{1,…,∣E(T)∣}f:E(T)\to\{1,\ldots,|E(T)|\} such that the vertex weights

w(v)=∑e∈E(v)f(e)w(v)=\sum_{e\in E(v)}f(e)

are distinct for every pair of distinct vertices u,v∈V(T)u,v\in V(T). Hartsfield's tree antimagic conjecture. Every tree other than K2K_2 is antimagic, meaning that it admits an antimagic labeling. This is the tree-specific conjecture stated alongside the general connected-graph conjecture; its status is not resolved by the supplied source context.

References

Primary source

Gee-Choon Lau, K. Premalatha, S. Arumugam and Wai-Chee Shiu, “On local antimagic chromatic number of cycle-related join graphs II”, arXiv:2112.04142 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.