Bipartite Ramsey numbers involving large Kn,n

https://doi.org/10.1016/j.ejc.2008.07.019Get rights and content
Under an Elsevier user license
open archive

Abstract

Let br(H1,H2) be the bipartite Ramsey number for bipartite graphs H1 and H2. It is shown that the order of magnitude of br(Kt,n,Kn,n) is nt+1/(logn)t for t1 fixed and n. Moreover, if H is an isolate-free bipartite graph of order h having bipartition (A,B) that satisfies Δ(B)t, then br(H,Kn,n) can be bounded from above by (hn/logn)t(logn)α(t) for large n, where α(1)=α(2)=1 and α(t)=0 for t3.

Cited by (0)

Supported in part by NSFC.