Book Ramsey numbers. I
Abstract
A book Bp is a graph consisting of p triangles sharing a common edge. In this paper we prove that if p ≤ q/6 -o(q) and q is large, then the Ramsey number r (BP,Bq) is given by r (BP, Bq) = 2q+3, and the constant 1/6 is essentially best possible. Our proof is based on Szemerédi's uniformity lemma and a stability result for books. © 2005 Wiley Periodicals, Inc.
Publication Title
Random Structures and Algorithms
Recommended Citation
Nikiforov, V., & Rousseau, C. (2005). Book Ramsey numbers. I. Random Structures and Algorithms, 27 (3), 379-400. https://doi.org/10.1002/rsa.20081
COinS
