Abstract :
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple finite hypergraph has an Egyptian edge-numbering. Moreover, it is shown that for every r⩾3 there exist arbitrarily large r-uniform connected finite hypergraphs not having an antimagic edge-numbering.
