Six-connectivity conjecture for global rigidity of 3-dimensional combinatorial zeolites
A 3-dimensional combinatorial zeolite is the line graph of a 4-regular graph. Let be such a graph, and suppose that 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 .
The source motivates this by the analogous two-dimensional result, where 3-connected combinatorial zeolites are globally rigid in . It also notes that a stronger 4-connectivity conjecture was posed by others; the 6-connectivity statement remains open in the supplied text.
References
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).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.