The star-critical Ramsey number rβ(H1, H2) is the smallest integer k such that every red/blue coloring of the edges of Kn β K1,nβkβ1 contains either a red copy of H1 or a blue copy of H2, where n is the graph Ramsey number R(H1, H2). We study the cases of rβ(C4, Cn) and R(C4, Wn). In particular, we prove that rβ(C4, Cn) = 5 for all n \u3e 4, obtain a general characterization of Ramsey-critical (C4, Wn)-graphs, and establish the exact values of R(C4, Wn) for 9 cases of n between 18 and 44
Let G be a graph, H be a subgraph of G, and let GβH be the graph
obtained from G by removing a copy of H. Let K1,nβ be the star on n+1 vertices. Let tβ₯2 be an integer and H1β,β¦,Htβ and H be
graphs, and let Hβ(H1β,β¦,Htβ) denote that every t
coloring of E(H) yields a monochromatic copy of Hiβ in color i for some
iβ[t]. Ramsey number r(H1β,β¦,Htβ) is the minimum integer N
such that KNββ(H1β,β¦,Htβ). Star-critical Ramsey number
rββ(H1β,β¦,Htβ) is the minimum integer k such that KNββK1,Nβ1βkββ(H1β,β¦,Htβ) where N=r(H1β,β¦,Htβ).
Let rr(H1β,β¦,Htβ) be the regular Ramsey number for H1β,β¦,Htβ, which is the minimum integer r such that if G is an r-regular
graph on r(H1β,β¦,Htβ) vertices, then Gβ(H1β,β¦,Htβ). Let m1β,β¦,mtβ be integers larger than one, exactly k of
which are even. In this paper, we prove that if kβ₯2 is even, then
rββ(K1,m1ββ,β¦,K1,mtββ)=βi=1tβmiββt+1β2kβ which disproves a conjecture of Budden and DeJonge in 2022.
Furthermore, we prove that if kβ₯2 is even, then rr(K1,m1ββ,β¦,K1,mtββ)=βi=1tβmiββt. Otherwise, rr(K1,m1ββ,β¦,K1,mtββ)=βi=1tβmiββt+1