Published August 20, 2019
| Submitted
Report
Open
A note on lower bounds for hypergraph Ramsey numbers
- Creators
- Conlon, David
Abstract
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform case, that r_(3)(l, l, l) ≥ 2^(l^(c log log l)). The old bound, due to Erdős and Hajnal, was r_(3)(l, l, l) ≥ 2^(cl^(2) log^(2) l).
Attached Files
Submitted - 0711.5004.pdf
Files
0711.5004.pdf
Files
(96.3 kB)
Name | Size | Download all |
---|---|---|
md5:8b270a4468b349b58691cc1fd81283be
|
96.3 kB | Preview Download |
Additional details
- Eprint ID
- 98015
- Resolver ID
- CaltechAUTHORS:20190819-170832267
- Created
-
2019-08-20Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field