This is the eleventh “research” thread of the Polymath16 project to make progress on the Hadwiger–Nelson problem, continuing this post. This project is a follow-up to Aubrey de Grey’s breakthrough result that the chromatic number of the plane is at least 5. Discussion of the project of a non-research nature should continue in the Polymath proposal page. We will summarize progress on the Polymath wiki page.
Here’s a brief summary of the progress made in the previous thread:
– Let w(k) denote the supremum of w such that is k-colorable. Then of course and for every . Furthermore,
– The largest known k-colorable disks for k=2,3,4,5 are depicted here.
Presumably, we can obtain descent upper bounds on w(4) by restricting (a finite subset of) the ring to an infinite strip.