Workshop characterization conjecture for generically universally rigid graphs on the line
Statement
Let be a graph on at least three vertices. A graph is generically universally rigid in if every one-dimensional generic framework of it is universally rigid.
Workshop characterization conjecture. The graph is generically universally rigid in if and only if it can be obtained from a set of triangles by edge reduced attachment and edge addition operations.
The characterization of generically universally rigid graphs is open in general, and this conjecture was proposed by participants of a 2011 workshop. The paper gives counterexamples to this conjectured characterization, so the conjecture is refuted.
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.