中文

A New Upper Bound for Diagonal Ramsey Numbers

组合数学 2007-05-23 v1

摘要

We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant CC such that r(k+1,k+1)kClogkloglogk(2kk).r(k+1, k+1) \leq k^{- C \frac{\log k}{\log \log k}} \binom{2k}{k}.

关键词

引用

@article{arxiv.math/0607788,
  title  = {A New Upper Bound for Diagonal Ramsey Numbers},
  author = {David Conlon},
  journal= {arXiv preprint arXiv:math/0607788},
  year   = {2007}
}

备注

22 pages