Tidier examples for lower bounds on diagonal Ramsey numbers

被引:5
作者
McDiarmid, C [1 ]
Steger, A [1 ]
机构
[1] UNIV BONN,FORSCHUNGSINST DISKRETE MATH,D-53113 BONN,GERMANY
关键词
D O I
10.1006/jcta.1996.0043
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
There is a family (H-k) of graphs such that H-k has order (1 + o(1))(root 2/e)k2(k/2) but has no clique or stable set of order Ic. This result of Spencer provides the best known lower bound for the diagonal Ramsey numbers R(k, k). Here we see that the graphs H-k can be taken to be regular, self-complementary, and pseudo-random. (C) 1996 Academic Press, Inc.
引用
收藏
页码:147 / 152
页数:6
相关论文
共 4 条
[1]  
Alon N., 1992, PROBABILISTIC METHOD
[2]   QUASI-RANDOM GRAPHS [J].
CHUNG, FRK ;
GRAHAM, RL ;
WILSON, RM .
COMBINATORICA, 1989, 9 (04) :345-362
[3]   RAMSEYS THEOREM - NEW LOWER BOUND [J].
SPENCER, J .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1975, 18 (01) :108-115
[4]   AN UPPER BOUND FOR SOME RAMSEY NUMBERS [J].
THOMASON, A .
JOURNAL OF GRAPH THEORY, 1988, 12 (04) :509-517