Abstract
Let $G$ be a finite abelian group, and let $m>0$ with $\exp(G)\mid m$. Let $s_{m}(G)$ be the generalized Erdős-Ginzburg-Ziv invariant, which denotes the smallest positive integer $d$ such that any sequence of elements in $G$ of length $d$ contains a subsequence of length $m$ with sum zero in $G$. For any integer $r>0$, let $\mathcal{I}_m^{(r)}$ be the collection of all $r$-uniform intersecting families of size $m$. Let $R(\mathcal{I}_m^{(r)},G)$ be the smallest positive integer $d$ such that any $G$-coloring of the edges of the complete $r$-uniform hypergraph $K_{d}^{(r)}$ yields a zero-sum copy of some intersecting family in $\mathcal{I}_m^{(r)}$. Among other results, we mainly prove that $\Omega(s_{m}(G))-1\leq R (\mathcal{I}_{m}^{(r)}, \ G)\leq \Omega(s_{m}(G)),$ where $\Omega(s_{m}(G))$ denotes the least positive integer $n$ such that ${n-1 \choose r-1}\geq s_{m}(G)$, and we show that if $r\mid \Omega(s_{m}(G))-1$ then $R (\mathcal{I}_{m}^{(r)}, \ G)= \Omega(s_{m}(G))$.
Introduction
Classical Ramsey theory investigates the minimum size of a structure required to guarantee the existence of a monochromatic substructure under any edge coloring. Zero-sum Ramsey theory introduces an algebraic dimension to this field: instead of seeking a single color, we assign elements from a finite abelian group $G$ to the edges of a graph or hypergraph. We then search for a subgraph where the sum of the group elements assigned to its edges equals the identity element (zero) of $G$.
While previous literature has extensively explored zero-sum Ramsey numbers for cyclic groups (such as $\mathbb{Z}_n$), this research extends the investigation to general finite abelian groups. Specifically, it focuses on intersecting families in $r$-uniform hypergraphs—sets of edges where every pair of edges shares at least one common vertex. The study aims to determine the threshold $R(\mathcal{I}_m^{(r)}, G)$, the minimum number of vertices needed to ensure a zero-sum intersecting family exists in any $G$-colored complete $r$-uniform hypergraph.
Theoretical Framework
The Generalized Erdős-Ginzburg-Ziv Invariant
The foundation of this work lies in the generalized Erdős-Ginzburg-Ziv (EGZ) invariant, denoted as $s_m(G)$. This constant represents the smallest integer $d$ such that any sequence of $d$ elements in $G$ contains a subsequence of length $m$ that sums to zero. The authors utilize this invariant to derive a new parameter, $\Omega(s_m(G))$, defined as the smallest integer $n$ satisfying: $${n-1 \choose r-1} \geq s_m(G)$$ This value essentially represents the number of vertices required for a "hyperstar" (a family where all edges share a single common vertex) to contain enough edges to force a zero-sum subsequence based on the EGZ property.
Combinatorial Methods
To establish bounds, the authors employ several key combinatorial tools:
- Baranyai’s Theorem: This theorem allows for the decomposition of complete hypergraphs into edge-disjoint factors, which is instrumental in constructing extremal colorings that avoid zero-sum structures, thereby establishing lower bounds.
- Structural Comparison: The research compares the requirements for finding a zero-sum hyperstar against those for finding a general intersecting family. This is motivated by the Erdős-Ko-Rado (EKR) Theorem, which suggests that in many contexts, the largest intersecting families are stars.
Key Insights and Results
The "Star" Bottleneck
A primary insight of this paper is that the zero-sum Ramsey number for a general intersecting family is dominated by the structure of a hyperstar. In large hypergraphs, the most efficient way to form a zero-sum intersecting family is typically to cluster the edges around a single vertex. This structural dominance allows the authors to pin down the Ramsey number with high precision.
Main Theorem
The central result of the paper provides tight bounds for the zero-sum Ramsey number of intersecting families: $$\Omega(s_m(G)) - 1 \leq R(\mathcal{I}_m^{(r)}, G) \leq \Omega(s_m(G))$$ This result shows that the Ramsey number is always one of two consecutive integers, effectively bridging the gap between additive number theory and extremal hypergraph theory.
Exact Values and Divisibility
The authors further refine this bound by demonstrating that the upper bound is exact under specific divisibility conditions. Specifically, if the uniformity $r$ divides $\Omega(s_m(G)) - 1$, then: $$R(\mathcal{I}_m^{(r)}, G) = \Omega(s_m(G))$$
Conclusion and Future Directions
This research successfully generalizes previous results regarding cyclic groups and delta-systems to the broader context of all finite abelian groups. While the bounds provided are remarkably tight, a universal rule to distinguish between the two possible values of $R(\mathcal{I}_m^{(r)}, G)$ in all cases remains an open question.
The authors propose Conjecture 3.1, suggesting that for certain ranges of $r$, the Ramsey numbers for intersecting families and hyperstars are identical. Furthermore, they suggest that extending this framework to $t$-intersecting families—where every pair of edges must share at least $t$ vertices—is a promising avenue for future research in zero-sum Ramsey theory.
Summary updated