论文信息 - Some constructive bounds on Ramsey numbers

Some constructive bounds on Ramsey numbers

We present explicit constructions of three families of graphs that yield the following lower bounds on Ramsey numbers: R(4,m)>=@W(m^8^/^5), R(5,m)>=@W(m^5^/^3), R(6,m)>=@W(m^2).

Vojtech Rödl | Alexandr V. Kostochka | Pavel Pudlák

[1] Noga Alon,et al. Explicit Ramsey graphs and orthonormal labelings , 1994, Electron. J. Comb..

[2] Jeong Han Kim,et al. The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.

[3] W. G. Brown. On Graphs that do not Contain a Thomsen Graph , 1966, Canadian Mathematical Bulletin.

[4] Pavel Pudlák,et al. Some structural properties of low-rank matrices related to computational complexity , 2000, Theor. Comput. Sci..

[5] Ingo Schiermeyer,et al. The Ramsey number r(C7, C7, C7) , 2003, Discuss. Math. Graph Theory.

[6] Joel H. Spencer,et al. Asymptotic lower bounds for Ramsey functions , 1977, Discret. Math..

[7] Felix Lazebnik,et al. Polarities and 2k-cycle-free graphs , 1999, Discret. Math..

[8] Noga Alon,et al. Norm-Graphs: Variations and Applications , 1999, J. Comb. Theory, Ser. B.

[9] Jason S. Williford,et al. On the independence number of the Erdos-Rényi and projective norm graphs and a related hypergraph , 2007 .

[10] R. M. Tanner. Explicit Concentrators from Generalized N-Gons , 1984 .

[11] N. Alon,et al. Constructive lower bounds for off-diagonal Ramsey numbers , 2001 .

[12] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.