Abstract

AbstractAn upper bound on the Ramsey number r(K2,n‐s,K2,n) where s ≥ 2 is presented. Considering certain r(K2,n‐s,K2,n)‐colorings obtained from strongly regular graphs, we additionally prove that this bound matches the exact value of r(K2,n‐s,K2,n) in infinitely many cases if $s \approx 2\sqrt n$ holds. Moreover, the asymptotic behavior of r(K2,m,K2,n) is studied for n being sufficiently large depending on m. We conclude with a table of all known Ramsey numbers r(K2,m,K2,n) where m,n ≤ 10. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 252–268, 2003

Full Text
Paper version not known

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 call

Disclaimer: 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.