zbMATH — the first resource for mathematics

On zero-sum partitions and anti-magic trees. (English) Zbl 1229.05031
Summary: We study zero-sum partitions of subsets in abelian groups, and apply the results to the study of anti-magic trees. Extension to the nonabelian case is also given.

05A17 Combinatorial aspects of partitions of integers
05C05 Trees
Full Text: DOI
[1] Alon, N.; Kaplan, G.; Lev, A.; Roditty, Y.; Yuster, R., Dense graphs are anti-magic, J. graph theory, 47, 297-309, (2004) · Zbl 1055.05132
[2] Figueroa-Centeno, R.M.; Ichishima, R.; Muntaner-Batle, F.A., Bertrand’s postulate and magical product labelings, Bulletin of the ICA, 30, 53-65, (2000) · Zbl 0959.05103
[3] M. Herzog, G. Kaplan, A. Lev, Universal partitions, preprint
[4] M. Herzog, G. Kaplan, A. Lev, Covering the alternating groups by products of cycle classes, J. Combinatorial Theory Ser. A (in press) · Zbl 1172.20002
[5] Hartsfield, N.; Ringel, G., Pearls in graph theory, (1990), Academic Press, INC. Boston, pp. 108-109. Revised version 1994
[6] Kaplan, G.; Lev, A.; Roditty, Y., Bertrand’s postulate, the prime number theorem and product anti-magic graphs, Discrete math., 308, 787-794, (2008) · Zbl 1140.05050
[7] O. Pihurko, Characterization of product anti-magic graphs of large order, preprint
[8] Robinson, D.J.S, A course in the theory of groups, (1982), Springer-Verlag, INC. New York · Zbl 0496.20038
[9] West, D., Introduction to graph theory, (1996), Simon@Schuster A Viacom Company Upper Saddle River, NJ 07458 · Zbl 0845.05001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.