On lower bounds of the order of $k$-chromatic unit distance graphs

Abstract

Here we give refined numerical values for the minimum number of vertices of $k$-chromatic unit distance graphs in the Euclidean plane.