Recursive construction conjecture for redundantly rigid graphs on concentric cylinders
Statement
Let be a graph, and let , , and be the three specified base graphs. The operations under consideration are edge addition, -extension, and -, - and -join. Recursive construction conjecture. If is 2-connected and redundantly rigid on some, equivalently every, family of concentric cylinders, then can be obtained from one of , , or by recursively applying those operations. This conjecture would provide the graph-theoretic step toward proving sufficiency in the global-rigidity characterization for concentric cylinders.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.