Kiraly–Tanigawa's body-pin rigidity characterization conjecture
Kiraly–Tanigawa's body-pin rigidity characterization conjecture
Let be a multigraph, and let be the body-pin graph obtained by replacing each with a body and identifying distinct pairs of body vertices according to the edges of . For disjoint subsets , let be the number of edges between them and define
Kiraly–Tanigawa's body-pin conjecture. The graph is rigid in if and only if, for every partition of ,
This is a conjectured characterization of rigidity for body-pin graphs in three dimensions. The source attributes it to Kiraly and Tanigawa and does not report a resolution.
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
Sign in to submit a solution.
No solutions have been posted yet.