This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A328419 #46 Oct 17 2024 14:46:20
%S A328419 1,1,1,4,26,374,11487,612884,48176183,5115840190,698180921122
%N A328419 Number of unlabeled minimally rigid graphs in 3D on n vertices.
%C A328419 All minimally rigid graphs in 3D on n vertices can be constructed from the minimally rigid graphs in 3D on n-1 vertices by use of three types of constructions called the Henneberg constructions. In the first type a new vertex is added to the graph and three new edges are added connecting the new vertex to three different vertices which were already part of the graph. In the second type of construction, two adjacent vertices, say v_1 and v_2, are selected. The edge between v_1 and v_2 is deleted. A new vertex w is added to the graph, as well as the edges (v_1,w), (v_2,w), (v_3,w), and (v_4,w), where v_3 and v_4 are other vertices of the graph. The third construction chooses two pairs of adjacent vertices v_1,v_2 and v_3,v_4, where v_3 might be equal to v_2. The edges (v_1,v_2) and (v_3,v_4) are deleted. A new vertex w is added to the graph. If v_2!=v_3, the edges (v_1,w), (v_2,w), (v_3,w), (v_4,w), and (v_5,w) are added, where v_5 is another vertex of the graph. If v_2=v_3, other two vertices v_5,v_6 are chosen and the edges (v_1,w), (v_2,w),(v_4,w), (v_5,w), and (v_6,w) are added.
%C A328419 The first two constructions preserve rigidity whereas the third does not necessarily preserve rigidity. Nevertheless the third construction is needed to get all minimally rigid graphs in 3D. Up to 11 vertices the first two constructions suffice.
%C A328419 Each of these three constructions adds one to the number of vertices and three to the number of edges, i.e., all those graphs have 3n-6 edges for n vertices. Not all graphs with that number of edges are minimally rigid in 3D.
%C A328419 Every minimally rigid graph in 3D is (3,6)-tight (A374745). - _Georg Grasegger_, Oct 17 2024
%H A328419 Georg Grasegger, <a href="/A328419/a328419.txt">Mathematica program: Minimally rigid graphs in 3D with n<=11 vertices</a>
%H A328419 Georg Grasegger, C. Koutschan and E. Tsigaridas, <a href="https://arxiv.org/abs/1710.08237">Lower bounds on the number of realizations of rigid graphs</a>, arXiv:1710.08237 [math.CO], 2017-2018; Experimental Mathematics, 2018 (doi: 10.1080/10586458.2018.1437851).
%H A328419 H. Pollaczek-Geiringer, <a href="https://doi.org/10.1002/zamm.19320120606">Zur Gliederungstheorie räumlicher Fachwerke</a>, Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 12(1932), 369-376 (doi:10.1002/zamm.19320120606).
%H A328419 Tiong-Seng Tay and Walter Whiteley, <a href="http://hdl.handle.net/2099/1047">Generating Isostatic Frameworks</a>, Structural Topology, 11 (1985), 21-69.
%t A328419 Table[Length[H12GeiringerGraphs[n]], {n, 4, 11}] (* see Link *)
%Y A328419 Cf. A227117 (number of minimally rigid graphs in 2D on n vertices).
%Y A328419 Cf. A374745 (number of (3,6)-tight graphs).
%K A328419 nonn,more
%O A328419 3,4
%A A328419 _Georg Grasegger_, Oct 28 2019
%E A328419 a(12) from _Georg Grasegger_, independently computed by _Martin Larsson_, Jan 10 2022
%E A328419 a(13) from _Georg Grasegger_, Oct 17 2024