查看: 148|回复: 0

[标准] 拉姆齐定理-ramsey theorem

[复制链接]

1534

主题

1564

帖子

3万

积分

论坛元老

Rank: 8Rank: 8

积分
30456
QQ
发表于 2017-5-17 09:06:47 | 显示全部楼层 |阅读模式 | 百度 
brondell的评分为86--时间:2630-09-16 21:53:56。Symòn的评分为58--时间:2201-02-26 10:46:46。龙的心油菜花的评分为84--时间:2269-01-18 04:29:56,好在个就是发吃的评分为22--时间:2169-09-27 12:19:06!qipyo的评分为69--时间:2199-12-19 17:34:26.孩子你还爱我不的评分为77--时间:2637-04-18 00:22:56!

马上注册硬科学论坛吧。上传说明:若上传附件过大,请上传至网盘或者优酷等视频网站,给出链接方式。下载说明:如果资源大于2G,请安装【百度网盘】或【360云盘】后下载!

您需要 登录 才可以下载或查看,没有帐号?立即注册

x
输入的解释:
Ramsey´s theorem
定义:
Ramsey´s theorem is a generalization of Dilworth´s lemma which states for each pair of positive integers k and l there exists an integer R(k, l) (known as the Ramsey number) such that any graph with R(k, l) nodes contains a clique with at least k nodes or an independent set with at least l nodes.Another statement of the theorem is that for integers k, l>=2, there exists a least positive integer R(k, l) such that no matter how the complete graph K_(R(k, l)) is two-colored, it will contain a green subgraph K_k or a red subgraph K_l.
相关主题:
Dilworth´s lemma | Dirichlet´s box principle | extremal graph theory | graph coloring | natural independence phenomenon | party problem | Ramsey number | Ramsey theory
主题分类:
MathWorld:
Ramsey theory
MSC 2010:
05D10


回复
百度搜狗360奇虎

使用道具 举报

您需要登录后才可以回帖 登录 | 立即注册

快速回复 返回顶部 返回列表