Zero-sum Ramsey numbers R(G, Γ) satisfy R(G, Γ) ≤ C n for bounded-degree n-vertex graphs G whenever |Γ| divides e(G).
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
For d-degenerate graphs satisfying m ≥ 2pd(d+1)^2, p|m and 2d<p, the zero-sum Ramsey number R(G, Z_p) is at most n + (3+3d)p.
citing papers explorer
-
A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs
Zero-sum Ramsey numbers R(G, Γ) satisfy R(G, Γ) ≤ C n for bounded-degree n-vertex graphs G whenever |Γ| divides e(G).
-
A linear upper bound on zero-sum Ramsey numbers of $d$-degenerate graphs in $\mathbb{Z}_p$
For d-degenerate graphs satisfying m ≥ 2pd(d+1)^2, p|m and 2d<p, the zero-sum Ramsey number R(G, Z_p) is at most n + (3+3d)p.