The conjecture that random 4-regular graphs are globally rigid in the real line
Statement
Let be a random -regular graph on vertices. Global rigidity is considered for frameworks in .
Random 4-regular graph rigidity conjecture. A random -regular graph with vertices is globally rigid in with high probability.
The preceding result rules out the analogous statement for random -regular graphs. For sufficiently large degrees, the paper's methods imply global rigidity with high probability, so the conjecture concerns whether degree four is already sufficient; the smallest suitable degree is otherwise left open.
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.