Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture

T.-S. Tay and W. Whiteley independently characterized the multigraphs which can be realized as an infinitesimally rigid d-dimensional body-and-hinge framework. In 1984 they jointly conjectured that each graph in this family can be realized as an infinitesimally rigid framework with the additional property that the hinges incident to each body lie in a common hyperplane. This conjecture has become known as the Molecular Conjecture because of its implication for the rigidity of molecules in 3-dimensional space. Whiteley gave a partial solution for the 2-dimensional form of the conjecture in 1989 by showing that it holds for multigraphs G=(V,E) in the family which have the minimum number of edges, i.e. satisfy 2|E|=3|V|−3. In this paper, we give a complete solution for the 2-dimensional version of the Molecular Conjecture. Our proof relies on a new formula for the maximum rank of a pin-collinear body-and-pin realization of a multigraph as a 2-dimensional bar-and-joint framework.

[1]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[2]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[3]  M. Thorpe,et al.  Rigidity theory and applications , 2002 .

[4]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[5]  Bill Jackson,et al.  Brick partitions of graphs , 2010, Discret. Math..

[6]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[7]  Tibor Jordán,et al.  Rank and independence in the rigidity matroid of molecular graphs , 2006 .

[8]  W. Whiteley,et al.  Statics of Frameworks and Motions of Panel Structures: A projective Geometric Introduction , 1982 .

[9]  Tiong-Seng Tay,et al.  Linking (n − 2)-dimensional panels inn-space II: (n − 2, 2)-frameworks and body and hinge structures , 1989, Graphs Comb..

[10]  Walter Whiteley,et al.  Recent Advances in the Generic Ridigity of Structures , 1984 .

[11]  L. Lovász,et al.  On Generic Rigidity in the Plane , 1982 .

[12]  Walter Whiteley,et al.  The Union of Matroids and the Rigidity of Frameworks , 1988, SIAM J. Discret. Math..

[13]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[14]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[15]  Bill Jackson,et al.  Rigid Components in Molecular Graphs , 2007, Algorithmica.

[16]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[17]  Walter Whiteley,et al.  Some matroids from discrete applied geometry , 1996 .

[18]  Bill Jackson,et al.  On the rigidity of molecular graphs , 2008, Comb..

[19]  W. Whiteley.  Counting out to the flexibility of molecules , 2005, Physical biology.

[20]  Walter Whiteley,et al.  A matroid on hypergraphs, with applications in scene analysis and geometry , 1989, Discret. Comput. Geom..

[21]  Tiong-Seng Tay,et al.  Rigidity of multi-graphs. I. Linking rigid bodies in n-space , 1984, J. Comb. Theory, Ser. B.