An upper bound for some ramsey numbers

From MaRDI portal





This paper is devoted to proving the following theorem concerning the Ramsey number \(r(k+1,h+1)\). Theorem 1. There is an absolute constant A such that \[ r(k+1,h+1)\leq \exp \{-\frac{1}{2k} \log k+A\sqrt{\log k}\}\left( \begin{matrix} k+h\\ k\end{matrix} \right) \] for all \(k\geq h\geq 1\). In particular, \[ r(k+1,k+1)\leq k^{-1/2+A/\sqrt{\log k}}\binom{2k}{k}. \]











This page was built for publication: An upper bound for some ramsey numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3809826)