  We present a family of finite unit-distance graphs in the plane that are not
4-colourable, thereby improving the lower bound of the Hadwiger-Nelson problem.
The smallest such graph that we have so far discovered has 1581 vertices.
