On the ramsey numbers for the tree graphs versus certain generalised wheel graphs

• Main Authors: Chng, Zhi Yee, Tan, Ta Sheng, Wong, Kok Bin
• Format: Article
• Published: Elsevier 2021
• Subjects: QA Mathematics
• Online Access: http://eprints.um.edu.my/27184/

Given two simple graphs G and H, the Ramsey number R(G, H) is the smallest integer n such that for any graph of order n, either it contains G or its complement contains H. Let T-n be a tree graph of order n and W-s,W-m be the generalised wheel graph K-s + C-m. In this paper, we show that for n >=...