Upper and lower bounds for Fv(4,4;5).
ELECTRONIC JOURNAL OF COMBINATORICS(2010)
摘要
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.
更多查看译文
关键词
null
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络