Upper and lower bounds for F-v(4,4;5)

作者：Xu, Xiaodong; Luo, Haipeng; Shao, Zehui

来源：Electronic Journal of Combinatorics, 2010, 17(1): N34.

• GRAPHS

In this note we give a computer assisted proof showing that the unique (5, 3)-Ramsey graph is the unique K-5-free graph of order 13 giving F-v(3, 4; 5) <= 13, then we prove that 17 <= F-v(2, 2, 2, 4; 5) <= F-v(4, 4; 5) <= 23. This improves the previous best bounds 16 <= F-v(4, 4; 5) <= 25 provided by Nenov and Kolev.

• 出版日期2010-10-22
• 单位广西科学院; 成都大学