An antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1,…,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it has an antimagic labeling. In [10], Ringel conjectured that every simple connected graph, other than K2, is antimagic. We prove several special cases and variants of this conjecture. Our main tool is the Combinatorial NullStellenSatz (cf. [1]). © 2005 Wiley Periodicals, Inc. J Graph Theory#R##N##R##N#This paper is a part of the author's Ph.D. under the supervision of Prof. Michael Krivelevich.
['Dan Hefetz']
Anti-magic graphs via the Combinatorial NullStellenSatz