On zero sum Ramsey numbers: Multiple copies of a graph
From MaRDI portal
Publication:4284100
DOI10.1002/jgt.3190180205zbMath0794.05081OpenAlexW2162227392MaRDI QIDQ4284100
Publication date: 24 March 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180205
Related Items
A complete characterization of the zero-sum (mod 2) Ramsey numbers, On zero‐sum delta‐systems and multiple copies of hypergraphs, A five color zero-sum generalization, Zero-sum subsequences in Abelian non-cyclic groups, On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families, Zero-sum problems -- a survey, On several variations of the turan and ramsey numbers, On zero-sum Ramsey numbers--stars, Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\), On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings, On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\), On a zero-sum generalization of a variation of Schur's equation
Cites Work
- Unnamed Item
- Unnamed Item
- Edge-colored complete graphs with precisely colored subgraphs
- On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
- Ramsey numbers for unions of some cycles
- On Ramsey numbers for large disjoint unions of graphs
- A simpler proof and a generalization of the zero-trees theorem
- On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
- On zero-trees
- Ramsey Theorems for Multiple Copies of Graphs
