An improved method for recursively computing upper bounds for two-colour Ramsey numbers

Authors

  • Kruger, Oliver

Abstract

The two-colour Ramsey number R(m, n) is the least natural number p such that any graph of order p must contain either a clique of size m or an independent set of size n. We exhibit a method for computing upper bounds for /i(m,n) recursively, using known upper bounds of R(-, •) with lower values for at least one of the arguments. We also show how this method can be ised to improve many of the best known bounds that are available in the literature. © 2020 Utilitas Mathematica Publishing Inc.. All rights reserved.

Published

2020-09-09

How to Cite

Kruger, Oliver. (2020). An improved method for recursively computing upper bounds for two-colour Ramsey numbers. Utilitas Mathematica, 116. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1472

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.