Answers are grounded in this paper and cite their sources.
This paper demonstrates the zero-sum Ramsey number for forests and resolves an existing conjecture, indicating the outcomes for various forest types.
Let k be a positive integer and let G be a graph. The zero-sum Ramsey number R(G,Zₖ) is the least integer N (if it exists) such that for every edge-coloring χ \, : \, E(KN) \, → \, Zₖ one can find a copy of G in KN such that ∑e \, ∈ \, E(G)χ(e) \, = \, 0. In 2019, Caro made a conjecture about the Z₃-Ramsey number of trees. In this paper, we settle this conjecture, fixing an incorrect case, and extend the result to forests. Namely, we show that {equation*} R(F,Z_3) = \{ {array}{ll} n+2, & if F is 1 (mod\, 3) regular or a star;\\ n+1, & if 3 d(v) for every v ∈ V(F) or F has exactly one \\ {placeholder} & vertex of degree 0 (mod\, 3) and all others are 1 (mod\, 3), \\ {placeholder} & and F is not 1 (mod\, 3) regular or a star;\\ n, & otherwise. {array} . {equation*} where F is any forest on n vertices with 3 e(F) and no isolated vertices.
No takes yet. Share an insight, caveat, or question.
Alvarado et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: