We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
For given graphs G and H, the Ramsey number R(G, H) is the smallest natural number n such that for every graph F of order n: either F contains G or the complement of F contains H. In this paper we investigate the Ramsey number R(∪G, H), where G is a tree and H is a wheel W m or a complete graph K m. We show that if n ≥ 3, then R(kS n , W 4) = (k + 1)n for k(More)
  • 1