Improved lower bound on an Euclidean Ramsey problem
Abstract
It was previously shown that any two-colour colouring of K(Cn) must contain a monochromatic planar K4 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.