Now showing 1 - 1 of 1
  • Some of the metrics are blocked by your 
    Item type:Publication,
    An Improved Lower Bound for Bipartite Ramsey Numbers br(2,7) and br(2,8)
    (2017-01-01) ;
    Intarapaiboon, Peerasak
    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 K<inf>b,b</inf> 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).