A385657 Number of nonisomorphic maximally dense unit-distance graphs on n vertices.

1, 1, 1, 1, 1, 4, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 7, 16, 3, 1, 5

Offset: 1

Author

Eric W. Weisstein, Aug 03 2025

Keywords

• nonn
• hard
• more

Links

• Boris Alexeev, Dustin G. Mixon, and Hans Parshall, The Erdős unit distance problem for small point sets, arXiv:2412.11914 [math.CO], 2024. See pp. 1, 12.
• Eric Weisstein's World of Mathematics, Erdos Unit Distance Problem.
• Eric Weisstein's World of Mathematics, Maximally Dense Unit-Distance Graph.

Crossrefs

Cf. A186705 (number of edges in these graphs = solution to Erdos unit distance problem).