Hartsfield's antimagic conjecture for connected graphs

From papers

Let GG be a connected graph. An antimagic labeling of GG is a bijection f:E(G){1,,E(G)}f:E(G)\to\{1,\ldots,|E(G)|\} such that the vertex weights

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

are distinct for every pair of distinct vertices u,vV(G)u,v\in V(G). Hartsfield's antimagic conjecture. Every connected graph other than K2K_2 is antimagic, meaning that it admits an antimagic labeling. This is one of the principal open conjectures on antimagic graph labelings and would establish the existence of such a labeling for every connected graph except the single edge.

Progress summary

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

Sources & referencesView supporting material

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).

Solutions 0

No solutions have been posted yet.