Six-connectivity conjecture for global rigidity of 3-dimensional combinatorial zeolites

From papers

A 3-dimensional combinatorial zeolite is the line graph of a 4-regular graph. Let GG be such a graph, and suppose that GG is 6-connected, meaning that deletion of any set of at most five vertices leaves it connected.

Combinatorial-zeolite conjecture. Every 6-connected 3-dimensional combinatorial zeolite is globally rigid in R3\mathbb{R}^3.

The source motivates this by the analogous two-dimensional result, where 3-connected combinatorial zeolites are globally rigid in R2\mathbb{R}^2. It also notes that a stronger 4-connectivity conjecture was posed by others; the 6-connectivity statement remains open in the supplied text.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Bill Jackson, Tibor Jordán and Soma Villányi, “Rank Contributions of Vertices in Rigidity Matroids of Clique Covered Graphs”, arXiv:2607.26266 (2026).

Solutions 0

No solutions have been posted yet.