Abstract
For any bipartite graph B, the bipartite Ramsey number brk(B) is defined to be the smallest integer N such that any edge-coloring of complete bipartite graph KN,N by k colors contains a monochromatic B. In this note, it is shown that brk(K2,s)∼(s−1)k2 for fixed s≥2 and brk(K3,3)∼k3 as k→∞.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
