The extremal sparsity conjecture for minimally globally rigid graphs
Statement
Let be a positive integer and let be a graph on at least vertices that is minimally globally rigid in . The extremal sparsity conjecture.
and the minimum degree of is at most . This conjecture concerns sharp sparsity bounds for minimally globally rigid graphs; the paper's abstract and introduction state that it is answered affirmatively, so its database status is solved.
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.