Math-1855 · mathematics · Combinatorics

Math-1855

Achieve global rigidity by pinning nodes

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $G=(V,E)$ be a finite simple graph. A placement $p:V\to\mathbb R^2$ is generic when its $2|V|$ coordinates are algebraically independent over $\mathbb Q$. Two placements are equivalent if their Euclidean edge lengths agree, and congruent if every pairwise distance agrees. The graph is generically globally rigid in the plane when every placement equivalent to a generic placement is congruent to it.

For $S\subseteq V$, let $G+K_S$ be obtained by adding every missing edge whose two endpoints lie in $S$. Define \[ p_2(G)=\min\{|S|:S\subseteq V,\ G+K_S \text{ is generically globally rigid in }\mathbb R^2\}. \] The task is to determine this minimum and construct an attaining set, seeking a polynomial-time algorithm or an effective combinatorial characterization of the optimum. The input is the graph, without a special geometric realization.

Adding the clique fixes all relative distances between selected vertices; it does not fix an absolute coordinate frame. The quantity being minimized counts selected vertices, not added edges. Selecting all vertices is always feasible, but provides no optimality guarantee. Global rigidity is essential: excluding continuous flexes alone does not exclude a second, isolated noncongruent realization with identical prescribed edge lengths.

Short English statement

How few vertices must be selected so that specifying every distance among them makes a graph generically globally rigid in the plane?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.