2007/11/30 by Conlon, David
#05C55 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.0711.5004
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform case, that r3 (l,l,l) ≥ 2^lc log log l. The old bound, due to Erdős and Hajnal, was r3 (l,l,l) ≥ 2c l2 log2 l.