A construction for Ramsey numbers for Km, n

被引：3

作者：

Dung, Lin ^{[1
,2
]}

Li, Yusheng ^{[1
]}

机构：

[1] Tongji Univ, Dept Math, Shanghai 200092, Peoples R China

[2] Shanghai Harbor E Logist Software Co Ltd, Shanghai 200080, Peoples R China

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 2010年 / 31卷 / 07期

关键词：

GRAPHS;

D O I：

10.1016/j.ejc.2010.05.002

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let integers k and in be fixed and let r(k)(G) be the Ramsey number of the graph Gin k colors. Using an algebraic construction it is shown that r(k)(K(m,) (n)) >= k(m)(n - n(0.525)) for large n. (C) 2010 Elsevier Ltd. All rights reserved.

引用

页码：1667 / 1670

页数：4

共 10 条

[1] Norm-graphs:: Variations and applications [J].

Alon, N ;

Rónyai, L ;

Szabó, T .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 76 (02) :280-290

[2]

Alon Noga, 1992, The Probabilistic Method

[3] The difference between consecutive primes, II [J].

Baker, RC ;

Harman, G ;

Pintz, J .

PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2001, 83 :532-562

[4]

Bollobas B., 1981, European Journal of Combinatorics, V2, P13

[5] GENERALIZED RAMSEY THEORY FOR GRAPHS .2. SMALL DIAGONAL NUMBERS [J].

CHVATAL, V ;

HARARY, F .

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1972, 32 (02) :389-+

[6]

EXOO G, 1991, P APPL MATH, pCH19

[7] CONSTRUCTIVE SOLUTION TO A TOURNAMENT PROBLEM [J].

GRAHAM, RL ;

SPENCER, JH .

CANADIAN MATHEMATICAL BULLETIN, 1971, 14 (01) :45-&

[8] Ramsey functions involving Km,n with n large [J].

Li, YS ;

Tang, XQ ;

Zang, WN .

DISCRETE MATHEMATICS, 2005, 300 (1-3) :120-128

[9] Bounds for Ramsey numbers of complete graphs dropping an edge [J].

Li, Yusheng ;

Shen, Jian .

EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (01) :88-94

[10]

WAGE N, 2002, ELECT J COMBIN NUMBE, V6

← 1 →