Loading...
An Improved Lower Bound for Bipartite Ramsey Numbers br(2,7) and br(2,8)
Author(s)
Intarapaiboon, Peerasak
Date Issued
January 1, 2017
Type
Conference Paper
Abstract
For complete bipartite graphs Ks,s,Kt,t, the bipartite Ramsey number br(s,t) is the least positive integer b such that if the edges of Kb,b are colored with red and blue, then there always exists a red Ks,s or a blue Kt,t. We obtain new lower bounds of br(2,7) and br(2,8).
Citation
Lecture Notes in Engineering and Computer Science, 2228, 976-978, 2017