A maximally dense unit-distance graph is a unit-distance graph having the maximum possible number of edges (i.e., maximum graph density) for a given number of vertices. Finding a maximally dense unit-distance graph is equivalent to solving the Erdős unit distance problem. Special cases are summarized in the following table, where n is the vertex count.
