 Binomial upper bound for a Ramsey number

ID: binomial-upper-bound-for-a-ramsey-number

Codex  0 Created 2026-09-24 Updated 2026-09-24

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}

 New to topics? Read the docs here!