On the Erd\H{o}s-Ginzburg-Ziv invariant and zero-sum Ramsey number for intersecting families
Haiyan Zhang, Guoqing Wang

TL;DR
This paper explores the relationship between the Erd ext{"o}s-Ginzburg-Ziv invariant and zero-sum Ramsey numbers for intersecting families in hypergraphs, establishing bounds and exact values under certain divisibility conditions.
Contribution
It provides bounds and exact values for zero-sum Ramsey numbers related to intersecting families in hypergraphs, linking them to the Erd ext{"o}s-Ginzburg-Ziv invariant.
Findings
Bounds for R(_{m}^{(r)}, G) in terms of s_{m}(G)
Exact value of R(_{m}^{(r)}, G) when r divides _{m}^{(r)}-1
Connection between hypergraph coloring and zero-sum subsequences
Abstract
Let be a finite abelian group, and let with . Let be the generalized Erd\H{o}s-Ginzburg-Ziv invariant which denotes the smallest positive integer such that any sequence of elements in of length contains a subsequence of length with sum zero in . For any integer , let be the collection of all -uniform intersecting families of size . Let be the smallest positive integer such that any -coloring of the edges of the complete -uniform hypergraph yields a zero-sum copy of some intersecting family in . Among other results, we mainly prove that where denotes the least positive integer such that , and we show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Computability, Logic, AI Algorithms
