Antimagic vertex labelings of hypergraphs Original Research Article

Hartsfield and Ringel (J. Recreat. Math. 21 (2) (1989) 107) conjectured that for simple, finite and connected graphs different from K2 there exists an antimagic edge labeling; by dualization this yields a conjecture on vertex labelings of a special class of hypergraphs. Investigating antimagic vertex labelings of hypergraphs it is easy to see that for many hypergraphs such a vertex labeling does not exist. In this paper we give constructive proofs for the existence of antimagic vertex labelings of several classes of hypergraphs, e.g. cacti, cycles and wheels.