most citedImproved lower bound on an Euclidean Ramsey problem

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2008★ 2 cited

Improved lower bound on an Euclidean Ramsey problem

Jerome Barkley

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 bou…