Published September 21, 2026 | Version v2

The Zero-Sum Ramsey Spectrum of Cactus Graphs Modulo Three

Authors/Creators

  • 1. Università degli Studi di Brescia

Description

Caro and Mifsud asked whether every graph $G$ whose number of edges is divisible by three satisfies $R(G,\mathbb{Z}_3)\le |V(G)|+8$.  We determine the zero-sum Ramsey spectrum modulo three for connected cactus graphs, that is, graphs in which every edge belongs to at most one cycle.  More precisely,
\[
 \{R(G,\mathbb{Z}_3)-|V(G)|:G\text{ is a connected cactus and }3\mid e(G)\}
   =\{0,1,2,4,8\}.
\]
The values $8$ and $4$ occur only for $K_3$ and for the graph formed by two triangles with one common vertex, respectively, while every other connected admissible cactus satisfies $R(G,\mathbb{Z}_3)-|V(G)|\in\{0,1,2\}$.  We also determine exact formulas for friendship graphs and for the graphs obtained from them by adding a positive number of pendant edges at the common vertex while preserving divisibility by three; these families realize each of the values $0,1,2$ infinitely often.

Notes

Substantially revised version. The cactus result has been strengthened to an exact determination of the zero-sum Ramsey spectrum, and the book-graph material has been removed for editorial reasons.

Files

AdditiveRamseySharp_cactus_spectrum.pdf

Files (586.5 kB)

Name Size
md5:8c6bc57de44a7f10ec9306d0aa49ac44
586.5 kB Preview Download