Dense graphs are antimagic

N. Alon, G. Kaplan, A. Lev +2

An {\em 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 dis…