How do mathematics go about finding larger Ramsey numbers such as R(5, 5)? How do they find upper bounds on these numbers?
Asked
Active
Viewed 238 times
6
-
A lower bound for $$R(l+1,l+1)$$ is $$R(l,l)+\left\lceil\frac{R(l,l)-l}{l-1}\right\rceil$$ – Roddy MacPhee Jan 08 '24 at 20:54
1 Answers
3
Some ideas:
A famous upper bound for any $k,l$ is from Erdos-Szekeres:
$R(k,l) \le \binom {k+l-2} {k-1}$.
In your case, $k=l=5$, so $R(5,5) \le \binom {8}{4}$
You can find some thoughts of Paul Erdos about Ramsey numbers in that sheet aswell. It is generally hard to find such big numbers in a very exact way, we don't have many methods to do that.
Atvin
- 3,392
-
The Erdos-Szekeres conjecture doesn't seem to be proven. Has it been? – Jimmy360 May 23 '15 at 21:04
-
http://en.wikibooks.org/wiki/Combinatorics/Bounds_for_Ramsey_numbers Here you can find it. – Atvin May 23 '15 at 21:05