For bipartite graphs G1,G2, the bipartite Ramsey number br(G1,G2) is the smallest integer b such that any subgraph G of the complete bipartite graph Kb,b,either G contains
a copy of G1 or its complement relative to Kb.b contains a copy of G2 . We obtained lower bounds of br(K2,2;Kn,n) for . for 6< n < 10
Keywords: Bipartite Ramsey numbers, lower bounds, graphs.
*Corresponding author: E-mail: numai_6060@hotmail.com
Adsawatithisakul, N. ., Summart*, W. ., Samana, D. ., & Samana, D. . (2018). Lower Bounds of Some Small Bipartite Ramsey Numbers br(K2,2;Kn,n). CURRENT APPLIED SCIENCE AND TECHNOLOGY, 154-161.

https://cast.kmitl.ac.th/articles/122448