M. S. A. Bataineh

Learn More
For any two graphs F 1 and F 2 , the graph Ramsey number r(F 1 , F 2) is the smallest positive integer N with the property that every graph on at least N vertices contains F 1 or its complement contains F 2 as a subgraph. In this paper, we consider the Ramsey numbers for theta-complete graphs. We determine r(θ n , K m) for m = 2, 3, 4 and n > m. More(More)
  • 1