Improved lower bound on an Euclidean Ramsey problem
| dc.creator | Barkley, Jerome | |
| dc.date | 2008-11-06 | |
| dc.date.accessioned | 2026-07-07T10:16:48Z | |
| dc.date.available | 2026-07-07T10:16:48Z | |
| dc.description | 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. | |
| dc.description | 8 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/0811.1055 | |
| dc.identifier | http://arxiv.org/abs/0811.1055 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/173634 | |
| dc.subject | Combinatorics | |
| dc.title | Improved lower bound on an Euclidean Ramsey problem | |
| dc.type | text |