On three zero‐sum Ramsey‐type problems
From MaRDI portal
Publication:4693356
DOI10.1002/jgt.3190170207zbMath0783.05074OpenAlexW2162728081MaRDI QIDQ4693356
Publication date: 13 March 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170207
Related Items (16)
A complete characterization of the zero-sum (mod 2) Ramsey numbers ⋮ Zero-sum subsequences in Abelian non-cyclic groups ⋮ On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families ⋮ Binomial coefficients and zero-sum Ramsey numbers ⋮ Zero-sum problems -- a survey ⋮ Unavoidable chromatic patterns in 2‐colorings of the complete graph ⋮ On the zero-sum Ramsey problem over \(\mathbb{Z}_2^d\) ⋮ Tight bounds for divisible subdivisions ⋮ Diagonal forms and zero-sum (mod 2) bipartite Ramsey numbers ⋮ Barycentric sequences and barycentric Ramsey numbers for stars. ⋮ Zero sum cycles in complete digraphs ⋮ Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\) ⋮ Diagonal forms of incidence matrices associated with \(t\)-uniform hypergraphs ⋮ Zero-sum bipartite Ramsey numbers ⋮ A polynomial-time algorithm for finding zero-sums. ⋮ A Survey of the Game “Lights Out!”
Cites Work
This page was built for publication: On three zero‐sum Ramsey‐type problems
