Abstract
For any bipartite graph B, the bipartite Ramsey number br(k) (B) is defined to be the smallest integer Nsuch that any edge-coloring of complete bipart......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
