A note on lower bounds for hypergraph Ramsey numbers

Simple item page
dc.creatorConlon, David
dc.date2007-11-30
dc.date.accessioned2026-07-07T08:46:29Z
dc.date.available2026-07-07T08:46:29Z
dc.descriptionWe 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}.\]
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/0711.5004
dc.identifierhttp://arxiv.org/abs/0711.5004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143263
dc.subjectCombinatorics
dc.subject05C55
dc.titleA note on lower bounds for hypergraph Ramsey numbers
dc.typetext

Files

Collections

arXiv