New Computational Upper Bounds for Ramsey Numbers $R(3,k)$

[摘要] Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: $R(3,10) \le 42$, $R(3,11) \le 50$, $R(3,13) \le 68$, $R(3,14) \le 77$, $R(3,15) \le 87$, and $R(3,16) \le 98$. All of them are improvements by one ov

[学科分类] 离散数学和组合数学

[关键词] Ramsey number;upper bound;computation