Zero sum cycles in complete digraphs
Authors:
- Tamás MészárosTMTamás Mészáros
- Raphael SteinerRSRaphael Steiner
- 1 December 2021
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 98
Abstract
No abstract availableAll Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft
This publication has 8 references indexed in Scilit:
- On generalized Erdős–Ginzburg–Ziv constants forJournal of Combinatorial Theory, Series A, 2020
- On generalized Erdős–Ginzburg–Ziv constants ofDiscrete Mathematics, 2019
- On zero-sum subsequences of lengthJournal of Combinatorial Theory, Series A, 2014
- Zero-sum problems in finite abelian groups: A surveyExpositiones Mathematicae, 2006
- On zero-sum subsequences of restricted size IIDiscrete Mathematics, 2003
- Zero-sum problems — A surveyDiscrete Mathematics, 1996
- On three zero‐sum Ramsey‐type problemsJournal of Graph Theory, 1993
- Cycles of length 0 modulo k in directed graphsJournal of Combinatorial Theory, Series B, 1989