Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949980 | Discrete Applied Mathematics | 2016 | 5 Pages |
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(nloglognlog2n)t for sufficiently large n; and for kâ¥3, brk(Kt,s;Kn,n)=Î(ntlogtn).
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Xiuwen Wang, Qizhong Lin,