The Lovász–Yemini connectivity conjecture for generic rigidity
Statement
Let be a positive integer. A graph is -connected when deleting fewer than vertices leaves it connected. The Lovász–Yemini conjecture. If a graph is -connected, then it is rigid in . This conjecture would extend connectivity criteria for finding rigid, and potentially globally rigid, subgraphs in dimensions . The source says that it has remained open for over forty years.
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.