10 citations · 11 across the 3 of their papers we have counts for
3 papers
math.CO2025
Nucleation-free independent graphs with implied nonedges
Jialong Cheng, Meera Sitharam, Ileana Streinu +1
We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the construct…
cs.CG2013★ 10 cited
Nucleation-free rigidity
Jialong Cheng, Meera Sitharam, Ileana Streinu
When all non-edge distances of a graph realized in as a {\em bar-and-joint framework} are generically {\em implied} by the bar (edge) lengths, the graph is said to…
cs.CG2010★ 1 cited
Maxwell-independence: a new rank estimate for 3D rigidity matroids
Jialong Cheng, Meera Sitharam
The problem of combinatorially determining the rank of the 3-dimensional bar-joint {\em rigidity matroid} of a graph is an important open problem in combinatorial rigidity theory.…