圈对完全图Ramsey数r（C4,Kn）的3个新下界

广东工业大学学报 ›› 2003, Vol. 20 ›› Issue (1): 86-88.

圈对完全图Ramsey数r（C₄,K_n）的3个新下界

中国矿业大学理学院；中国矿业大学理学院徐州221008；徐州221008；徐州221008；

出版日期:2003-02-08 发布日期:2003-02-08

Lower Bounds of Three Ramsey Numbers for C4 vs. a Complete Graph

(College of Science China University of Mining and Technology,Xuzhou 221008,China)

Online:2003-02-08 Published:2003-02-08

摘要/Abstract

摘要： 构造3个不含C4的图,得到3个圈对完全图的Ramsey数的新下界:r(C4,K9)≥25,r(C4,K14)≥49,r(C4,K27)≥121.

杨铀；薛秀谦；段滋明； . 圈对完全图Ramsey数r（C₄,K_n）的3个新下界[J]. 广东工业大学学报, 2003, 20(1): 86-88.

YANG You,XUE Xiuqian,DUAN Ziming. Lower Bounds of Three Ramsey Numbers for C4 vs. a Complete Graph[J]. Journal of Guangdong University of Technology, 2003, 20(1): 86-88.

参考文献 1

[1] 杨铀,段滋明. 求解图的最大独立集的一种算法[J]. 电脑开发与应用. 2002(06)

Metrics

Viewed

Full text

1901

HTML			PDF

Just accepted	Online first	Issue	Just accepted	Online first	Issue
0	0	0	0	0	1901

From	Others	local

Times	341	1560
Rate	18%	82%

Abstract

218

Just accepted	Online first	Issue

0	0	218

From	Others	local

Times	46	172
Rate	21%	79%

Cited

Web of Science	Crossref	ScienceDirect	Search for Citations in Google Scholar >>


This page requires you have already subscribed to WoS.

Shared

Discussed

圈对完全图Ramsey数r（C₄,K_n）的3个新下界

Lower Bounds of Three Ramsey Numbers for C4 vs. a Complete Graph

HTML

PDF (PC)

摘要/Abstract

引用本文

使用本文

参考文献 1

相关文章 0

Metrics

本文评价

推荐阅读 0