Skip to main content

and
  1. No Access

    Article

    Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs

    The Ramsey number r(H, K n ) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of siz...

    Tao Jiang, Michael Salerno in Graphs and Combinatorics (2011)