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.CG2024
Graphs with single interval Cayley configuration spaces in 3-dimensions
William Sims, Meera Sitharam
We prove a conjectured graph theoretic characterization of a geometric property of 3 dimensional linkages posed 15 years ago by Sitharam and Gao, motivated by their equivalent char…
math.MG2024
Edge-length preserving embeddings of graphs between normed spaces
Sean Dewar, Eleftherios Kastis, Derek Kitson +1
The concept of graph flattenability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces…