Large Book-Cycle Ramsey Numbers

From MaRDI portal



Abstract: Let Bn(k) be the book graph which consists of n copies of Kk+1 all sharing a common Kk, and let Cm be a cycle of length m. In this paper, we first determine the exact value of r(Bn(2),Cm) for frac89n+112lemlelceilfrac3n2ceil+1 and ngeq1000. This answers a question of Faudree, Rousseau and Sheehan (Cycle--book Ramsey numbers, {it Ars Combin.,} {�f 31} (1991), 239--248) in a stronger form when m and n are large. Building upon this exact result, we are able to determine the asymptotic value of r(Bn(k),Cn) for each kgeq3. Namely, we prove that for each kgeq3, r(Bn(k),Cn)=(k+1+ok(1))n. This extends a result due to Rousseau and Sheehan (A class of Ramsey problems involving trees, {it J.~London Math.~Soc.,} {�f 18} (1978), 392--396).












This page was built for publication: Large Book-Cycle Ramsey Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857008)