首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Bounds on Ramsey Numbers of Certain Complete Bipartite Graphs
Authors:Roland Lortz  Ingrid Mengersen
Institution:1. Technische Universit?t Braunschweig Abteilung Diskrete Mathematik, Germany
2. Volkswagen AG Informationssysteme Fahrzeugplanung, Brieffach 1830, 38436, Wolfsburg, Germany
3. Moorhüttenweg 2d, 38104, Braunschweig, Germany
Abstract:Bounds on the Ramsey number r(Kl,m,Kl,n), where we may assume l ≤ m ≤ n, are determined for 3 ≤ l ≤ 5 and m ≈ n. Particularly, for m = n the general upper bound on r(Kl,n, Kl,n) due to Chung and Graham is improved for those l. Moreover, the behavior of r(K3,m, K3,n) is studied for m fixed and n sufficiently large.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号