On zero-trees
From MaRDI portal
Recommendations
Cited in
(15)- A generalization of Kneser's addition theorem
- On a zero-sum generalization of a variation of Schur's equation
- A polynomial-time algorithm for finding zero-sums.
- A simpler proof and a generalization of the zero-trees theorem
- On four colored sets with nondecreasing diameter and the Erdős-Ginzburg-Ziv theorem
- Zero-sum subsequences in Abelian non-cyclic groups
- Zero-sum problems -- a survey
- Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
- On zero-sum spanning trees and zero-sum connectivity
- Zero-sum copies of spanning forests in zero-sum complete graphs
- An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphs
- scientific article; zbMATH DE number 4214018 (Why is no real title available?)
- On zero sum Ramsey numbers: Multiple copies of a graph
- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
- A five color zero-sum generalization
This page was built for publication: On zero-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013413)
