Proves R(G, Z_p) ≤ n + 6p - 9 for n-vertex graphs G with (p-1)-sized 2-packing when p prime divides e(G) and minimum degree at least 1.
Combinatorica , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A linear upper bound on the $\mathbb{Z}_p$-Ramsey number of graphs with sufficiently large $2$-packing
Proves R(G, Z_p) ≤ n + 6p - 9 for n-vertex graphs G with (p-1)-sized 2-packing when p prime divides e(G) and minimum degree at least 1.