Ramsey numbers for graph sets versus complete graphs

被引：0
|
作者：
Faudree, R
Harborth, H
Mengersen, I
机构：
[1] MEMPHIS STATE UNIV, MEMPHIS, TN 38152 USA
[2] TECH UNIV CAROLO WILHELMINA BRAUNSCHWEIG, D-3300 BRAUNSCHWEIG, GERMANY
来源：
UTILITAS MATHEMATICA | 1996年 / 50卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The set Ramsey number r(n)(k, ((n)(2))) is the smallest integer r such that if the edges of a complete graph Kr are 2-colored, then there will be a graph with n vertices and k edges in the first color or a graph with n vertices and ((n)(2)) (e.g. a complete graph) in the second color. For each n greater than or equal to 3 and 1 less than or equal to k less than or equal to n, the set Ramsey numbers r(n)(k, ((n)(2))) are determined.
引用
收藏
页码：85 / 95
页数：11
相关论文
共 50 条
12345