A finite partition theorem with double exponential bounds

Details A finite partition theorem with double exponential bounds A finite partition theorem with double exponential bounds

1995-02-15

arxiv.org/abs/math/9502234v1

Algorithms Combin. 14 (1997), 240-246

Mathematics

Combinatorics

Scientific paper

We prove that double exponentiation is an upper bound to Ramsey theorem for
colouring of pairs when we want to predetermine the order of the differences
of successive members of the homogeneous set.

Affiliated with

Also associated with

No associations

Rating

A finite partition theorem with double exponential bounds 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 finite partition theorem with double exponential bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A finite partition theorem with double exponential bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-343426