ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd be a positive integer and let G=(V,E)G=(V,E) be a graph on at least d+2d+2 vertices that is minimally globally rigid in Rd\mathbb{R}^d. The extremal sparsity conjecture.

∣E∣≤(d+1)∣V∣−(d+22)|E|\leq (d+1)|V|-\binom{d+2}{2}

and the minimum degree of GG is at most 2d+12d+1. 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 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.