A308349 Number of minimal unit-distance forbidden graph minors on n vertices.

0, 0, 0, 1, 1, 1, 3, 13, 55

Offset

1,7

References

K. B. Chilakamarri and C. R. Mahoney, Maximal and minimal forbidden unit-distance graphs in the plane, Bulletin of the ICA, 13 (1995), 35-43.

Links

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

Aidan Globus and Hans Parshall, Small unit-distance graphs in the plane, arXiv:1905.07829 [math.CO], 2019.

Eric Weisstein's World of Mathematics, Unit-Distance Graph

Example

For n=4, the graph is K_4.
For n=5, the graph is K_{2,3}.
For n=6, the graph is formed from the wheel W_6 by deleting a spoke edge.

Crossrefs

Cf. A059103 (simple connected unit-distance graphs).

Cf. A227117 (minimally rigid graphs).

Sequence in context: A362495 A305655 A354505 * A367153 A396395 A140320

Adjacent sequences: A308346 A308347 A308348 * A308350 A308351 A308352

Keyword

nonn,hard,more

Author

Eric W. Weisstein, May 21 2019

Status

approved