Soma Villanyi: Every d(d+1)-connected graph is globally rigid in d dimensions.

from blog Combinatorics and more, | ↗ original
Today, I want to tell you a little about the following paper that solves a conjecture of Laszlo Lovász and Yechiam Yemini from 1982 and an even stronger conjecture of Bob Connelly, Tibor Jordán, and Walter Whiteley from 2013: Every … Continue reading →