ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let K5−eK_5-e, H1H_1, and H2H_2 be the three specified base graphs. The operations under consideration are edge addition, 11-extension, and 11-, 22- and 33-join. Recursive construction conjecture. If GG is 2-connected and redundantly rigid on some, equivalently every, family of concentric cylinders, then GG can be obtained from one of K5−eK_5-e, H1H_1, or H2H_2 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.