A simpler proof and a generalization of the zero-trees theorem
From MaRDI portal
Publication:1180556
DOI10.1016/0097-3165(91)90063-MzbMath0756.05085OpenAlexW2109832592MaRDI QIDQ1180556
P. D. Seymour, Alexander Schrijver
Publication date: 27 June 1992
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(91)90063-m
Related Items
A complete characterization of the zero-sum (mod 2) Ramsey numbers, A five color zero-sum generalization, On zero sum Ramsey numbers: Multiple copies of a graph, Zero-sum subsequences in Abelian non-cyclic groups, Zero-sum copies of spanning forests in zero-sum complete graphs, Zero-sum problems -- a survey, Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\), On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\), A generalization of Kneser's addition theorem, On a zero-sum generalization of a variation of Schur's equation, Zero-sum bipartite Ramsey numbers, On zero-sum spanning trees and zero-sum connectivity, A polynomial-time algorithm for finding zero-sums., An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphs, On four colored sets with nondecreasing diameter and the Erdős-Ginzburg-Ziv theorem
Cites Work
