A New Upper Bound for Diagonal Ramsey Numbers

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

22 pages

Scientific paper

We prove a new upper bound for diagonal two-colour Ramsey numbers, showing
that there exists a constant $C$ such that \[r(k+1, k+1) \leq k^{- C \frac{\log
k}{\log \log k}} \binom{2k}{k}.\]

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A New Upper Bound for Diagonal 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 New Upper Bound for Diagonal Ramsey Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Upper Bound for Diagonal Ramsey Numbers will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-33957

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.