On a Combinatorial Theorem of Erdös, Ginzburg and Ziv

DOI10.1017/S0963548398003721zbMath1057.05507OpenAlexW2030446850MaRDI QIDQ4238170

Asdrubal Ortuño, Oscar Ordaz, Yahya Ould Hamidoune

Publication date: 16 May 1999

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548398003721

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Extremal set theory (05D05) Special sequences and polynomials (11B83)

Related Items (13)

Representing Sequence Subsums as Sumsets of Near Equal Sized Sets ⋮ Zero-sum problems in finite Abelian groups: a survey ⋮ Zero-sum problems and coverings by proper cosets ⋮ Barycentric sequences and barycentric Ramsey numbers for stars. ⋮ Representation of group elements as subsequence sums. ⋮ Two zero-sum problems and multiple properties ⋮ A weighted generalization of two theorems of Gao ⋮ On the structure of \(p\)-zero-sum free sequences and its application to a variant of Erdős-Ginzburg-Ziv theorem ⋮ Sums and \(k\)-sums in abelian groups of order \(k\) ⋮ Yahya Ould Hamidoune's mathematical journey: a critical review of his work ⋮ A generalization of Kneser's addition theorem ⋮ Existence conditions for barycentric sequences. ⋮ Iterated sumsets and setpartitions

This page was built for publication: On a Combinatorial Theorem of Erdös, Ginzburg and Ziv