ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a random 44-regular graph on nn vertices. Global rigidity is considered for frameworks in R\mathbb{R}.

Random 4-regular graph rigidity conjecture. A random 44-regular graph with nn vertices is globally rigid in R\mathbb{R} with high probability.

The preceding result rules out the analogous statement for random 33-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 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.