Ramsey numbers for complete graphs versus generalized fans

Abstract

For two graphs G and H, let r(G,H) and r*(G,H) denote the Ramsey number and star-critical Ramsey number of G versus H, respectively. In 1996, Li and Rousseau proved that r(Km,Ft,n)=tn(m-1)+1 for m≥ 3 and sufficiently large n, where Ft,n=K1+nKt. Recently, Hao and Lin proved that r(K3,F3,n)=6n+1 for n≥ 3 and r(K3,F3,n)=3n+3 for n≥ 4. In this paper, we show that r(Km, sFt,n)=tn(m+s-2)+s for sufficiently large n and, in particular, r(K3, sFt,n)=tn(s+1)+s for t∈\3,4\,n≥ t and s≥1. We also show that r(K3, F4,n)=4n+4 for n≥ 4 and establish an upper bound on r(F2,m,Ft,n).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…