Hartsfield's antimagic conjecture for trees
Let be a tree. An antimagic labeling of is a bijection such that the vertex weights
are distinct for every pair of distinct vertices . Hartsfield's tree antimagic conjecture. Every tree other than 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.