Binomial upper bound for a Ramsey number

The off-diagonal recursion

R (s, t) \leq R (s - 1, t) + R (s, t - 1)

with

R (1, t) = R (s, 1) = 1

gives

R (s, t) \leq (s - 1 s + t - 2) .

In particular,

R (t) \leq (t - 1 2 t - 2) < 2^{2 t}

.

 Ancestors (7)

 Incoming links (8)

Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford / 2010 / A / 2 / a / Solution
Past exam of the mathematics course of the University of Cambridge / 2015 / ii / Paper 2 / 14I / b / Solution
Past exam of the mathematics course of the University of Cambridge / 2015 / ii / Paper 2 / 14I / c / Solution
Past exam of the mathematics course of the University of Cambridge / 2017 / ii / Paper 3 / 15H / Solution
Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 4 / 17I / Solution
Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 132 / 2 / b / Solution
Past exam of the mathematics course of the University of Cambridge / 2025 / ii / Paper 4 / 17F / a / Solution
Ramsey number

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version