The problem From the usual Euclidean plane we form the following graph: the points of the plane are the vertices of our graph, and two vertices are connected by an edge if they are exactly unit distance apart. The so-called Hadwiger-Nelson problem is to compute the chromatic number of this graph, i.e., the least amount … Continue reading "Chromatic Number of the Plane is at least 5"
This is the first post of a series of posts in which we will eventually venture deep into the realm of coarse geometry. But we will always be motivated by questions which are related to the one that we will discuss here. But our first steps into coarse geometry will be very gently: we will … Continue reading "Norms of infinite matrices"