Abstract
For graphs G and H , the Ramsey number R ( G , H ) is the smallest positive integer n such that every graph F of order n contains G or the complement of F contains H . For the path P n and the wheel W m , it is proved that R ( P n , W m ) = 2 n - 1 if m is even, m ⩾ 4 , and n ⩾ ( m / 2 ) ( m - 2 ) , and R ( P n , W m ) = 3 n - 2 if m is odd, m ⩾ 5 , and n ⩾ ( m - 1 / 2 ) ( m - 3 ) .
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.
