A note on lower bounds for hypergraph Ramsey numbers

Details A note on lower bounds for hypergraph Ramsey numbers A note on lower bounds for hypergraph Ramsey numbers

2007-11-30

arxiv.org/abs/0711.5004v1

Mathematics

Combinatorics

6 pages

Scientific paper

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}.\]

Affiliated with

Also associated with

No associations

Rating

A note on lower bounds for hypergraph Ramsey numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on lower bounds for hypergraph Ramsey numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on lower bounds for hypergraph Ramsey numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703256