摘要
本文证明了一类特殊的循环图是（3,q）—图,从而得到当q≥9且q是奇数时,r（3。
In this note, a special kind of cyclic graphs G with n vertices is constructed, so the following theorem and corollary are obtained:Theorem: Let q>9 and q be an odd integer, 0<j<1 / 2(q-11), n = 8(q-8)+l, i= 1, 4, 6, 9, 11, 14, 27, 30,…, 16j+11, 16j+14,…, 8(q-8)-8, 8(q-8)-5, 8(q-8)-3, 8(q-8), The cyclic graph Gg With n vetlices has neither K3 nor Kq-independent set.Corollary: r(3,q) > 8(q-8)+2, if q = odd (Let q>29, The above formula has improved r(3,q)> 7(q-5)+2, if q = odd in[1])
出处
《贵州科学》
1994年第4期16-19,共4页
Guizhou Science
关键词
下界公式
循环图
拉塞数
图
formula of lower bounds for Ramsey numbers r(3,q)
Cyclic graph
