David Conlon
Published 2007-11-30Version 1
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\H{o}s and Hajnal, was \[r_3 (l,l,l) \geq 2^{c l^2 \log^2 l}.\]
Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions
On the number of 1-perfect binary codes: a lower bound
Hypergraph Ramsey numbers: tight cycles versus cliques
![QR code for arXiv:0711.5004 [math.CO]](http://oss.arxitics.com/images/favicon.svg)