A note on lower bounds for hypergraph Ramsey numbers
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) \geq 2^{l^{c \log \log l}}.\] The old bound, due to Erdős and Hajnal, was \[r_3 (l,l,l) \geq 2^{c l^2 \log^2 l}.\]
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2007
- DOI:
- 10.48550/arXiv.0711.5004
- arXiv:
- arXiv:0711.5004
- Bibcode:
- 2007arXiv0711.5004C
- Keywords:
-
- Mathematics - Combinatorics;
- 05C55
- E-Print:
- 6 pages