Dense graphs are antimagic

  title={Dense graphs are antimagic},
  author={Noga Alon and Gil Kaplan and Arieh Lev and Yehuda Roditty and Raphael Yuster},
  journal={Journal of Graph Theory},
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 the same vertex. A graph is called antimagic if it has an antimagic labeling. A conjecture of Ringel (see [4]) states that every connected graph, but K2, is antimagic. Our main result validates this conjecture for graphs having minimum degree Ω(log n… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 40 extracted citations


Publications referenced by this paper.
Showing 1-4 of 4 references

Pearls in Graph Theory, Academic Press

N. Hartsfield, G. Ringel
INC., Boston, • 1990
View 2 Excerpts
Highly Influenced

Extremal Graph Theory

B. Bollobás
View 1 Excerpt
Highly Influenced

Problems and Results on 3-chromatic Hypergraphs and Some Related Questions

P. Erdos-L Lovász
View 2 Excerpts
Highly Influenced

The Probabilistic Method

SODA • 1992
View 2 Excerpts

Similar Papers

Loading similar papers…