Hartsfield–Ringle antimagic labeling conjecture for connected graphs
Hartsfield–Ringle antimagic labeling conjecture for connected graphs
Let be a simple connected graph, and let an antimagic labeling be a bijection from to for which the vertex sums—the sums of labels on edges incident to each vertex—are pairwise distinct. Hartsfield–Ringle's conjecture. Every simple connected graph other than is antimagic. This is a central conjecture in graph labeling; it is known for several graph classes and for graphs of sufficiently large minimum degree, but remains open for general connected graphs.
Sources & referencesView supporting material
Primary source
Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam, Victor Larsen and Danny Rorabaugh, “List-antimagic labeling of vertex-weighted graphs”, arXiv:1510.05070 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.