Indexed by：
Abstract：
For any bipartite graph H, let us denote the bipartite Ramsey number brk(H;Kn,n) to be the minimum integer N such that any edge-coloring of the complete bipartite graph KN,N by k+1 colors contains a monochromatic copy of H in some color i for 1≤i≤k, or a monochromatic copy of Kn,n in the last color. In this note, it is shown that for any fixed integers t≥2 and s≥(t−1)!+1, there exists a constant c=c(t)＞0 such that br2(Kt,s;Kn,n)≥c()t for sufficiently large n; and for k≥3, brk(Kt,s;Kn,n)=Θ(). © 2016 Elsevier B.V.
Keyword：
Reprint 's Address：
Email：
Source ：
Discrete Applied Mathematics
ISSN： 0166-218X
Year： 2016
Volume： 213
Page： 238-242
0 . 9 5 6
JCR@2016
1 . 0 0 0
JCR@2023
ESI HC Threshold：177
JCR Journal Grade：2
CAS Journal Grade：4
Cited Count：
SCOPUS Cited Count： 2
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
Affiliated Colleges：
