Zero-sum problems -- a survey
From MaRDI portal
Publication:1917486
DOI10.1016/0012-365X(94)00308-6zbMath0856.05068MaRDI QIDQ1917486
Publication date: 5 September 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
hypergraph; zero-sum problems; zero-sum Ramsey number; zero-sum Ramsey theory; Erdös-Ginzburg-Ziv theorem
Related Items
Unification of zero-sum problems, subset sums and covers of ℤ, ON DAVENPORT'S CONSTANT, Contributions to zero-sum problems, A five color zero-sum generalization, Zero-sum problems in finite Abelian groups: a survey, Minimal zero-sum sequences in \(C_{n}\oplus C_{n}\), Representation of group elements as subsequence sums., Addition theorems on the cyclic groups of order \(p^\ell\)., On the number of subsequences with given sum, Minimal zero-sequences and the strong Davenport constant, A complete characterization of the zero-sum (mod 2) Ramsey numbers, Monochromatic and zero-sum sets of nondecreasing diameter, On weighted sums in abelian groups, Binomial coefficients and zero-sum Ramsey numbers, Zero-sum problems and coverings by proper cosets, On zero-sum subsequences of restricted size. II., Remarks on some zero-sum problems, Barycentric sequences and barycentric Ramsey numbers for stars., Reconstructing permutation matrices from diagonal sums, Quasi-periodic decompositions and the Kemperman structure theorem, Existence conditions for barycentric sequences., Weighted sums in finite cyclic groups, On four colored sets with nondecreasing diameter and the Erdős-Ginzburg-Ziv theorem, A zero-sum theorem, Zero-sum subsequences in Abelian non-cyclic groups, On the Erdös-Ginzburg-Ziv theorem, Two zero-sum problems and multiple properties, Pairing conjugate partitions by residue classes, Davenport constant with weights and some related questions. II., An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphs, A Weighted Generalization of Gao's n + D − 1 Theorem
Cites Work
- Regular subgraphs of almost regular graphs
- Edge-colored complete graphs with precisely colored subgraphs
- Every 4-regular graph plus an edge contains a 3-regular subgraph
- Linear upper bounds for local Ramsey numbers
- Ramsey numbers for local colorings
- Local \(k\)-colorings of graphs and hypergraphs
- Diophantine problems in variables restricted to the values 0 and 1
- Set systems with no union of cardinality 0 modulo \(m\)
- On the subsets product in finite groups
- A simpler proof and a generalization of the zero-trees theorem
- Some notes on the Erdős-Szekeres theorem
- On zero-sum Ramsey numbers--stars
- On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
- On a combinatorial problem of Erdős, Ginzburg, and Ziv
- On induced subgraphs of trees, with restricted degrees
- A linear upper bound in zero-sum Ramsey theory
- A complete characterization of the zero-sum (mod 2) Ramsey numbers
- On induced subgraphs with odd degrees
- A note on the addition of residues
- Homomorphiesätze für Graphen
- Abschätzung der asymptotischen Dichte von Summenmengen
- Diagonal Ramsey numbers for small graphs
- Generalized Ramsey theory for graphs XII: Bipartite Ramsey sets
- On zero‐sum delta‐systems and multiple copies of hypergraphs
- On zero-trees
- On several variations of the turan and ramsey numbers
- ON ZERO SUM RAMSEY NUMBERS—COMPLETE GRAPHS
- ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS
- On zero sum Ramsey numbers: Multiple copies of a graph
- The number of zero sums modulo m in a sequence of length n
- Problems in Zero-Sum Combinatorics
- On some developments of the Erdős–Ginzburg–Ziv Theorem II
- On three zero‐sum Ramsey‐type problems
- On the Addition of Residue Classes
- Ein Extremalproblem für Gitterpunkte.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
