Improved lower bound on an Euclidean Ramsey problem

Details Improved lower bound on an Euclidean Ramsey problem Improved lower bound on an Euclidean Ramsey problem

2008-11-06

arxiv.org/abs/0811.1055v1

Mathematics

Combinatorics

8 pages, 1 figure

Scientific paper

It was previously shown that any two-colour colouring of K(C_n) must contain
a monochromatic planar K_4 subgraph for n >= N^*, where 6 <= N^* <= N and N is
Graham's number. The bound was later improved to 11 <= N^* <= N. In this
article, it is improved to 13 <= N^* <= N.

Affiliated with

Also associated with

No associations

Rating

Improved lower bound on an Euclidean Ramsey problem 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 Improved lower bound on an Euclidean Ramsey problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved lower bound on an Euclidean Ramsey problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-228409