A complete characterization of the zero-sum (mod 2) Ramsey numbers
From MaRDI portal
Publication:1336447
DOI10.1016/0097-3165(94)90098-1zbMath0808.05075OpenAlexW2058348494MaRDI QIDQ1336447
Publication date: 22 November 1994
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(94)90098-1
Related Items
On the existence of zero-sum perfect matchings of complete graphs, 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, On the zero-sum Ramsey problem over \(\mathbb{Z}_2^d\), Tight bounds for divisible subdivisions, Barycentric sequences and barycentric Ramsey numbers for stars., Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\), Unnamed Item, Diagonal forms of incidence matrices associated with \(t\)-uniform hypergraphs, On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\), On zero-sum spanning trees and zero-sum connectivity, The uniformity space of hypergraphs and its applications
Cites Work
- Edge-colored complete graphs with precisely colored subgraphs
- Set systems with no union of cardinality 0 modulo \(m\)
- A simpler proof and a generalization of the zero-trees theorem
- On zero-sum Ramsey numbers--stars
- On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
- Zero-sum problems -- a survey
- On zero‐sum delta‐systems and multiple copies of hypergraphs
- On several variations of the turan and ramsey numbers
- ON ZERO SUM RAMSEY NUMBERS—COMPLETE GRAPHS
- On zero sum Ramsey numbers: Multiple copies of a graph
- On three zero‐sum Ramsey‐type problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
