For an integer rβ₯2 and bipartite graphs Hiβ, where 1β€iβ€r,
the bipartite Ramsey number br(H1β,H2β,β¦,Hrβ) is the minimum integer N
such that any r-edge coloring of the complete bipartite graph KN,Nβ
contains a monochromatic subgraph isomorphic to Hiβ in color i for some
i, 1β€iβ€r. We show that for Ξ±1β,Ξ±2β>0, br(C2βΞ±1βnββ,C2βΞ±2βnββ)=(Ξ±1β+Ξ±2β+o(1))n.
We also show that if rβ₯3,Ξ±1β,Ξ±2β>0,Ξ±j+2ββ₯[(j+2)!β1]βi=1j+1βΞ±iβ for j=1,2,β¦,rβ2, then
br(C2βΞ±1βnββ,C2βΞ±2βnββ,β¦,C2βΞ±rβnββ)=(βj=1rβΞ±jβ+o(1))n. For ΞΎ>0 and sufficiently large n, let G be a
bipartite graph with bipartition {V1β,V2β}, β£V1ββ£=β£V2ββ£=N, where
N=(2+8ΞΎ)n. We prove that if Ξ΄(G)>(87β+9ΞΎ)N, then any
2-edge coloring of G contains a monochromatic copy of C2nβ.Comment: 19 page