English

Ramsey numbers of quadrilateral versus books

Combinatorics 2021-08-26 v1

Abstract

A book BnB_n is a graph which consists of nn triangles sharing a common edge. In this paper, we study Ramsey numbers of quadrilateral versus books. Previous results give the exact value of r(C4,Bn)r(C_4,B_n) for 1n141\le n\le 14. We aim to show the exact value of r(C4,Bn)r(C_4,B_n) for infinitely many nn. To achieve this, we first prove that r(C4,B(m1)2+(t2))m2+tr(C_4,B_{(m-1)^2+(t-2)})\le m^2+t for m4m\ge4 and 0tm10 \leq t \leq m-1. This improves upon a result by Faudree, Rousseau and Sheehan (1978) which states that \begin{align*} r(C_4,B_n)\le g(g(n)), \;\;\text{where}\;\;g(n)=n+\lfloor\sqrt{n-1}\rfloor+2. \end{align*} Combining the new upper bound and constructions of C4C_4-free graphs, we are able to determine the exact value of r(C4,Bn)r(C_4,B_n) for infinitely many nn. As a special case, we show r(C4,Bq2q2)=q2+q1r(C_4,B_{q^2-q-2}) = q^2+q-1 for all prime power q4q\ge4.

Keywords

Cite

@article{arxiv.2108.11201,
  title  = {Ramsey numbers of quadrilateral versus books},
  author = {Tianyu Li and Qizhong Lin and Xing Peng},
  journal= {arXiv preprint arXiv:2108.11201},
  year   = {2021}
}

Comments

12 pages