Loading...
Lower bounds of some small bipartite ramsey numbers br(K 2,2 ;k nn, )
Author(s)
Date Issued
July 1, 2017
Type
Article
Abstract
For bipartite graphs G 1 , G 2 , the bipartite Ramsey number br(G 1 ,G 2 ) is the smallest integer b such that any subgraph G of the complete bipartite graph K bb, , either G contains a copy of G 1 or its complement relative to K bb, contains a copy of G 2 . We obtained lower bounds of br(K 2,2 ;K nn, ) for 6≤ n ≤10.
Citation
Current Applied Science and Technology, 17(2), 154-161, 2017