Published September 2009
| Submitted
Journal Article
Open
A new upper bound for diagonal Ramsey numbers
- Creators
-
Conlon, David
Abstract
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) ≤ k^[-C log k/(log log k (2k_k).
Additional Information
© 2009 Princeton University. Received 11 July 2006; revised 14 November 2007. The author is kindly supported by a grant from St John's College, Cambridge. I would like to thank Béla Bollobás, Tim Gowers, Ben Green and Tom Sanders for their advice and encouragement.Attached Files
Submitted - 0607788.pdf
Files
0607788.pdf
Files
(195.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:cceddafd5d1649adc6d9d6e45e217d5e
|
195.8 kB | Preview Download |
Additional details
- Eprint ID
- 97812
- Resolver ID
- CaltechAUTHORS:20190812-162957624
- St. John's College, Cambridge
- Created
-
2019-08-15Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field