New Upper Bounds for Ramsey Numbers

详细信息    查看全文

• 作者：Huang ; Y. R. ; Zhang ; K. M.
• 刊名：European Journal of Combinatorics
• 出版年：1998
• 出版时间：April, 1998
• 年：1998
• 卷：19
• 期：3
• 页码：391-394
• 全文大小：79.3 K

文摘

The Ramsey numberR(G₁,G₂) is the smallest integerpsuch that for any graphGonpvertices eitherGcontainsG₁orcontainsG₂, wheredenotes the complement ofG. LetR(m,n)=R(K_m,K_n). Some new upper bound formulas are obtained forR(G₁,G₂andR(m,n), and we derive some new upper bounds for Ramsey numbers here.