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,6

Comments

See the Weisstein link titled "Maximally Dense ..." for comprehensive figures for a(1) to a(15). - Peter Munn, Sep 09 2025

Links

Table of n, a(n) for n=1..21.

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).

Sequence in context: A094244 A075447 A217684 * A327980 A094804 A396851

Adjacent sequences: A385654 A385655 A385656 * A385658 A385659 A385660

Keyword

nonn,hard,more

Author

Eric W. Weisstein, Aug 03 2025

Status

approved