Improved lower bound on an Euclidean Ramsey problem
Combinatorics
2008-11-10 v1
Abstract
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.
Cite
@article{arxiv.0811.1055,
title = {Improved lower bound on an Euclidean Ramsey problem},
author = {Jerome Barkley},
journal= {arXiv preprint arXiv:0811.1055},
year = {2008}
}
Comments
8 pages, 1 figure