Abstract
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 ⩾ 2 , even n and R ( kS n , W 4 ) = ( k + 1 ) n - 1 for k ⩾ 1 and odd n. We also show that R ( ⋃ i = 1 k T n i , K m ) = R ( T n k , K m ) + ∑ i = 1 k - 1 n i .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
