A New Upper Bound for Diagonal Ramsey Numbers
| dc.creator | Conlon, David | |
| dc.date | 2006-07-30 | |
| dc.date.accessioned | 2026-07-07T07:21:10Z | |
| dc.date.available | 2026-07-07T07:21:10Z | |
| dc.description | We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant $C$ such that \[r(k+1, k+1) \leq k^{- C \frac{\log k}{\log \log k}} \binom{2k}{k}.\] | |
| dc.description | 22 pages | |
| dc.identifier | https://arxiv.org/abs/math/0607788 | |
| dc.identifier | http://arxiv.org/abs/math/0607788 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115210 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C55 | |
| dc.title | A New Upper Bound for Diagonal Ramsey Numbers | |
| dc.type | text |