A note on lower bounds for hypergraph Ramsey numbers
Conlon, David
Original · EN
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform case, that r₃ (l,l,l) ≥ 2lc l. The old bound, due to Erdős and Hajnal, was r₃ (l,l,l) ≥ 2c l² ² l.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.