Graph minimization,focusing on the example of 5-chromatic unit-distance graphs in the plane

摘要

We introduce a new graph minimization method,in which it is required to preserve some graph property and there is an effective procedure for checking this property.We applied this method to minimize 5-chromatic unit-distance graphs and obtained a graph with 509 vertices and 2442 edges.