For any large connected sparse graph G on n vertices, the Ramsey number r(G,tB_k) equals 2n+t-2, extending the tree-book result to all sparse graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Ramsey numbers of sparse graphs versus disjoint books
For any large connected sparse graph G on n vertices, the Ramsey number r(G,tB_k) equals 2n+t-2, extending the tree-book result to all sparse graphs.