Linking (n - 2)-dimensional panels inn-space I: (k - 1,k)-graphs and (k - 1,k)-frames

摘要: A (k - 1,k)-graph is a multi-graph satisfyinge' ≤ 1)v' k for every non-empty subset ofe' edges onv' vertices, with equality whene' = |E(G)|. 1,k)-frame structure generalizing an (n 2, 2)-framework inn-space, consisting of set 2)-dimensional bodies inn-space and rigid bars each joining pair using ball joints. We prove that graph the minimally (with respect to edges) if only it 1,k)-graph. Rigidity here means infinitesimal rigidity or equivalently statical rigidity.