A generalized Ramsey problem

被引：16

作者：

Axenovich, M

机构：

[1] Iowa State Univ, Ames Lab, Ames, IA 50011 USA

[2] Univ Illinois, Urbana, IL 61801 USA

来源：

DISCRETE MATHEMATICS | 2000年 / 222卷 / 1-3期

关键词：

D O I：

10.1016/S0012-365X(00)00052-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let f(n) be the minimum number such that there is a proper edge-coloring of K-n with f(n) colors with no path or cycle of 4 edges using one or two colors. It is shown that [(1 + root 5)/2]n - 3 less than or equal to f(n) less than or equal to 2n(1+cj root log n) for a positive constants c. This improves the existent bounds on the variant of the Ramsey number f(n, 5, 9) studied by Erdos and Gyarfas. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：247 / 249

页数：3